n=int(eval(input()))

li=[]

ans=0

fl=1



for i in range(n):

    li.append(int(eval(input())))



li.sort()



for j in range(n-1):

    if li[j]!=li[j+1]:

        if fl%2==1:

            ans+=1

            fl=1

        else:

            fl=1

    else:

        fl+=1





if fl%2==1:

    ans+=1



print(ans)
n=int(eval(input()))

li=set()



for i in range(n):

    a=int(eval(input()))

    if a in li:

        li.remove(a)

    else:

        li.add(a)

 

print((len(li)))
n = int(eval(input()))
li = []
ans = 0
fl = 1
for i in range(n):
    li.append(int(eval(input())))
li.sort()
for j in range(n - 1):
    if li[j] != li[j + 1]:
        if fl % 2 == 1:
            ans += 1
            fl = 1
        else:
            fl = 1
    else:
        fl += 1
if fl % 2 == 1:
    ans += 1
print(ans)

n = int(eval(input()))
li = set()
for i in range(n):
    a = int(eval(input()))
    if a in li:
        li.remove(a)
    else:
        li.add(a)
print((len(li)))

-li = [] -ans = 0 -fl = 1 +li = set() -    li.append(int(eval(input()))) -li.sort() -for j in range(n - 1): -    if li[j] != li[j + 1]: -        if fl % 2 == 1: -            ans += 1 -            fl = 1 -        else: -            fl = 1 +    a = int(eval(input())) +    if a in li: +        li.remove(a) -        fl += 1 -if fl % 2 == 1: -    ans += 1 -print(ans) +        li.add(a) +print((len(li)))