#! /usr/bin/env python3



from fractions import gcd

from collections import Counter, deque, defaultdict

from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge

from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort

from itertools import accumulate, product, permutations, combinations, combinations_with_replacement



N = int(eval(input()))

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



c = Counter(A)



ct = 0

for i in list(c.values()):

    if i % 2 != 0:

        ct += 1



print(ct)
#! /usr/bin/env python3



from fractions import gcd

# from math import gcd

from collections import Counter, deque, defaultdict

from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge

from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort

from itertools import accumulate, product, permutations, combinations, combinations_with_replacement



N = int(eval(input()))

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



c = Counter(A)



ret = 0

for key, item in list(c.items()):

    if item % 2 == 1:

        ret += 1



print(ret)
#! /usr/bin/env python3
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import (
    accumulate,
    product,
    permutations,
    combinations,
    combinations_with_replacement,
)

N = int(eval(input()))
A = [int(eval(input())) for _ in range(N)]
c = Counter(A)
ct = 0
for i in list(c.values()):
    if i % 2 != 0:
        ct += 1
print(ct)

#! /usr/bin/env python3
from fractions import gcd

# from math import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import (
    accumulate,
    product,
    permutations,
    combinations,
    combinations_with_replacement,
)

N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
c = Counter(A)
ret = 0
for key, item in list(c.items()):
    if item % 2 == 1:
        ret += 1
print(ret)

+ +# from math import gcd -A = [int(eval(input())) for _ in range(N)] +A = [int(eval(input())) for i in range(N)] -ct = 0 -for i in list(c.values()): -    if i % 2 != 0: -        ct += 1 -print(ct) +ret = 0 +for key, item in list(c.items()): +    if item % 2 == 1: +        ret += 1 +print(ret)