锤子剪刀布

def solve(n, games_data):
    n = int(n)
    games = str(games_data).strip().split(',')
    j_win = b_win = tie = 0
    j_cnt = {'C': 0, 'J': 0, 'B': 0}
    b_cnt = {'C': 0, 'J': 0, 'B': 0}
    wins = {('C', 'J'), ('J', 'B'), ('B', 'C')}
    for g in games[:n]:
        parts = g.split()
        j, b = parts[0], parts[1]
        if (j, b) in wins:
            j_win += 1
            j_cnt[j] += 1
        elif j == b:
            tie += 1
        else:
            b_win += 1
            b_cnt[b] += 1
    print(f'{j_win} {tie} {b_win}')
    best_j = max(j_cnt, key=lambda x: (j_cnt[x], x))
    best_b = max(b_cnt, key=lambda x: (b_cnt[x], x))
    print(f'{best_j} {best_b}')