划拳

def solve(n, data):
    n = int(n)
    games = str(data).strip().split(',')
    a_win = b_win = 0
    for g in games[:n]:
        parts = list(map(int, g.split()))
        a_call, a_show, b_call, b_show = parts
        total = a_show + b_show
        a_right = (a_call == total)
        b_right = (b_call == total)
        if a_right and not b_right:
            a_win += 1
        elif b_right and not a_right:
            b_win += 1
    print(f'{a_win} {b_win}')