N = int(eval(input()))

A = sorted([int(eval(input())) for i in range(N)])

c = 0

n = 1

for i in range(N - 1):

    if A[i + 1] == A[i]:

        n += 1

    else:

        if n % 2 == 1:

            c += 1

        n = 1

if n % 2 == 1:

    c += 1

print(c)
from collections import Counter

N = int(eval(input()))

A = [int(eval(input())) for _ in range(N)]

C = Counter(A)

c = 0

for k, v in list(C.items()):

    if v % 2 == 1:

        c += 1

print(c)
N = int(eval(input()))
A = sorted([int(eval(input())) for i in range(N)])
c = 0
n = 1
for i in range(N - 1):
    if A[i + 1] == A[i]:
        n += 1
    else:
        if n % 2 == 1:
            c += 1
        n = 1
if n % 2 == 1:
    c += 1
print(c)

from collections import Counter

N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
C = Counter(A)
c = 0
for k, v in list(C.items()):
    if v % 2 == 1:
        c += 1
print(c)

+from collections import Counter + -A = sorted([int(eval(input())) for i in range(N)]) +A = [int(eval(input())) for _ in range(N)] +C = Counter(A) -n = 1 -for i in range(N - 1): -    if A[i + 1] == A[i]: -        n += 1 -    else: -        if n % 2 == 1: -            c += 1 -        n = 1 -if n % 2 == 1: -    c += 1 +for k, v in list(C.items()): +    if v % 2 == 1: +        c += 1