

from bisect import bisect_left,bisect_right



N = int(eval(input()))

A_list = []

for i in range(N):

    A_list.append(int(eval(input())))



A_unique = list(set(A_list))





A_list.sort()



ans = 0

for a in A_unique:

    if (bisect_right(A_list,a)-bisect_left(A_list,a))%2 == 1:

        ans += 1

        

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

A_list = []

for i in range(N):

    A_list.append(int(eval(input())))

    

A_list.sort()



res = 0

cnt = 0

ans = 0

for a in A_list:

    if res == a:

        cnt += 1

    else:

        ans += cnt%2

        res = a

        cnt = 1

        

ans += cnt%2



print(ans)
from bisect import bisect_left, bisect_right

N = int(eval(input()))
A_list = []
for i in range(N):
    A_list.append(int(eval(input())))
A_unique = list(set(A_list))
A_list.sort()
ans = 0
for a in A_unique:
    if (bisect_right(A_list, a) - bisect_left(A_list, a)) % 2 == 1:
        ans += 1
print(ans)

N = int(eval(input()))
A_list = []
for i in range(N):
    A_list.append(int(eval(input())))
A_list.sort()
res = 0
cnt = 0
ans = 0
for a in A_list:
    if res == a:
        cnt += 1
    else:
        ans += cnt % 2
        res = a
        cnt = 1
ans += cnt % 2
print(ans)

-from bisect import bisect_left, bisect_right - -A_unique = list(set(A_list)) +res = 0 +cnt = 0 -for a in A_unique: -    if (bisect_right(A_list, a) - bisect_left(A_list, a)) % 2 == 1: -        ans += 1 +for a in A_list: +    if res == a: +        cnt += 1 +    else: +        ans += cnt % 2 +        res = a +        cnt = 1 +ans += cnt % 2