import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time



sys.setrecursionlimit(10**7)

inf=10**20

mod=10**9+7



def LI(): return list(map(int,input().split()))

def I(): return int(eval(input()))

def LS(): return input().split()

def S(): return eval(input())



def main():

  n=I()



  l=[I() for _ in range(n)]



  l.sort()



  l2=[]

  for x in l:

    if len(l2)>0:

      if x==l2[-1]:

        l2.pop()

      else:

        l2.append(x)

    else:

      l2.append(x)



  return len(l2)



print((main()))

import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy



sys.setrecursionlimit(10**7)

inf=10**20

mod=10**9+7

dd=[(-1,0),(0,1),(1,0),(0,-1)]

ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]



def LI(): return [int(x) for x in sys.stdin.readline().split()]

def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]

def I(): return int(sys.stdin.readline())

def LS(): return sys.stdin.readline().split()

def S(): return eval(input())



# Summarize count of factor within list

def summarize_list(l):

  sl=sorted(l)



  a=sl[0]

  c=1

  res=[]



  for x in sl[1:]:

    if x==a:

      c+=1

    else:

      res.append([a,c])

      a=x

      c=1

  res.append([a,c])



  return res



def main():

  n=I()

  l=[I() for _ in range(n)]



  ans=0

  l=summarize_list(l)



  for x in l:

    if x[1]%2!=0:

      ans+=1

  return ans



# main()

print((main()))

import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7


def LI():
    return list(map(int, input().split()))


def I():
    return int(eval(input()))


def LS():
    return input().split()


def S():
    return eval(input())


def main():
    n = I()
    l = [I() for _ in range(n)]
    l.sort()
    l2 = []
    for x in l:
        if len(l2) > 0:
            if x == l2[-1]:
                l2.pop()
            else:
                l2.append(x)
        else:
            l2.append(x)
    return len(l2)


print((main()))

import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]


def LI():
    return [int(x) for x in sys.stdin.readline().split()]


def LI_():
    return [int(x) - 1 for x in sys.stdin.readline().split()]


def I():
    return int(sys.stdin.readline())


def LS():
    return sys.stdin.readline().split()


def S():
    return eval(input())


# Summarize count of factor within list
def summarize_list(l):
    sl = sorted(l)
    a = sl[0]
    c = 1
    res = []
    for x in sl[1:]:
        if x == a:
            c += 1
        else:
            res.append([a, c])
            a = x
            c = 1
    res.append([a, c])
    return res


def main():
    n = I()
    l = [I() for _ in range(n)]
    ans = 0
    l = summarize_list(l)
    for x in l:
        if x[1] % 2 != 0:
            ans += 1
    return ans


# main()
print((main()))

-import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time +import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, queue, copy +dd = [(-1, 0), (0, 1), (1, 0), (0, -1)] +ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)] -    return list(map(int, input().split())) +    return [int(x) for x in sys.stdin.readline().split()] + + +def LI_(): +    return [int(x) - 1 for x in sys.stdin.readline().split()] -    return int(eval(input())) +    return int(sys.stdin.readline()) -    return input().split() +    return sys.stdin.readline().split() +# Summarize count of factor within list +def summarize_list(l): +    sl = sorted(l) +    a = sl[0] +    c = 1 +    res = [] +    for x in sl[1:]: +        if x == a: +            c += 1 +        else: +            res.append([a, c]) +            a = x +            c = 1 +    res.append([a, c]) +    return res + + -    l.sort() -    l2 = [] +    ans = 0 +    l = summarize_list(l) -        if len(l2) > 0: -            if x == l2[-1]: -                l2.pop() -            else: -                l2.append(x) -        else: -            l2.append(x) -    return len(l2) +        if x[1] % 2 != 0: +            ans += 1 +    return ans +# main()