import collections

import sys

input = sys.stdin.readline



n = int(eval(input()))

a = [0]*n

ans = 0

for i in range(n):

    a[i] = int(eval(input()))

count_a = collections.Counter(a).most_common()

for i in range(len(count_a)):

    if count_a[i][1]%2 != 0:

        ans += 1

print(ans)
import sys

read = sys.stdin.buffer.read

readline = sys.stdin.buffer.readline

readlines = sys.stdin.buffer.readlines

sys.setrecursionlimit(10 ** 7)



from collections import Counter



n = int(readline())

a = [int(readline()) for _ in range(n)]

ans = 0

for v in list(Counter(a).values()):

    ans += 1 if v % 2 == 1 else 0

print(ans)

import collections
import sys

input = sys.stdin.readline
n = int(eval(input()))
a = [0] * n
ans = 0
for i in range(n):
    a[i] = int(eval(input()))
count_a = collections.Counter(a).most_common()
for i in range(len(count_a)):
    if count_a[i][1] % 2 != 0:
        ans += 1
print(ans)

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**7)
from collections import Counter

n = int(readline())
a = [int(readline()) for _ in range(n)]
ans = 0
for v in list(Counter(a).values()):
    ans += 1 if v % 2 == 1 else 0
print(ans)

-import collections -input = sys.stdin.readline -n = int(eval(input())) -a = [0] * n +read = sys.stdin.buffer.read +readline = sys.stdin.buffer.readline +readlines = sys.stdin.buffer.readlines +sys.setrecursionlimit(10**7) +from collections import Counter + +n = int(readline()) +a = [int(readline()) for _ in range(n)] -for i in range(n): -    a[i] = int(eval(input())) -count_a = collections.Counter(a).most_common() -for i in range(len(count_a)): -    if count_a[i][1] % 2 != 0: -        ans += 1 +for v in list(Counter(a).values()): +    ans += 1 if v % 2 == 1 else 0