n=int(eval(input()))

buff=[]

ans=1

for i in range(n):

    buff.append(eval(input()))



a=sorted(buff)



for i in range(1,n):

    if a[i] == a[i-1]:

        a[i-1]= -1

        a[i]= -1

        if ans>0:

            ans -= 1

    else:

        ans += 1



print(ans)

n=int(eval(input()))

buff=set()

for i in range(n):

    a=int(eval(input()))

    if a in buff:

        buff.remove(a)

    else:

        buff.add(a)



print((len(buff)))
n = int(eval(input()))
buff = []
ans = 1
for i in range(n):
    buff.append(eval(input()))
a = sorted(buff)
for i in range(1, n):
    if a[i] == a[i - 1]:
        a[i - 1] = -1
        a[i] = -1
        if ans > 0:
            ans -= 1
    else:
        ans += 1
print(ans)

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

-buff = [] -ans = 1 +buff = set() -    buff.append(eval(input())) -a = sorted(buff) -for i in range(1, n): -    if a[i] == a[i - 1]: -        a[i - 1] = -1 -        a[i] = -1 -        if ans > 0: -            ans -= 1 +    a = int(eval(input())) +    if a in buff: +        buff.remove(a) -        ans += 1 -print(ans) +        buff.add(a) +print((len(buff)))