from collections import Counter, deque

# from copy import copy, deepcopy

# from fractions import gcd

# from functools import reduce

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

# import math

# import numpy as np

# from operator import xor

import sys

sys.setrecursionlimit(10 ** 5 + 10)

# input = sys.stdin.readline



def resolve():

    N=int(eval(input()))

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



    AA=Counter(A)

    cnt=0

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

        if i%2==1:

            cnt+=1



    print(cnt)



resolve()
from collections import Counter, deque # https://note.nkmk.me/python-scipy-connected-components/

# from copy import copy, deepcopy

# from fractions import gcd

# from functools import reduce

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

# import math

# import numpy as np  # Pythonのみ！

# from operator import xor

# import re

# from scipy.sparse.csgraph import connected_components  # Pythonのみ！

# ↑cf.  https://note.nkmk.me/python-scipy-connected-components/

# from scipy.sparse import csr_matrix

# import string

import sys

sys.setrecursionlimit(10 ** 5 + 10)

def input(): return sys.stdin.readline().strip()



def resolve():

    N=int(eval(input()))

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

    AA=Counter(A)



    cnt=0

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

        if i%2==1:

            cnt+=1

    print(cnt)







resolve()
from collections import Counter, deque

# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np
# from operator import xor
import sys

sys.setrecursionlimit(10**5 + 10)
# input = sys.stdin.readline
def resolve():
    N = int(eval(input()))
    A = [int(eval(input())) for i in range(N)]
    AA = Counter(A)
    cnt = 0
    for i in list(AA.values()):
        if i % 2 == 1:
            cnt += 1
    print(cnt)


resolve()

from collections import (
    Counter,
    deque,
)  # https://note.nkmk.me/python-scipy-connected-components/

# from copy import copy, deepcopy
# from fractions import gcd
# from functools import reduce
# from itertools import accumulate, permutations, combinations, combinations_with_replacement, groupby, product
# import math
# import numpy as np  # Pythonのみ！
# from operator import xor
# import re
# from scipy.sparse.csgraph import connected_components  # Pythonのみ！
# ↑cf.  https://note.nkmk.me/python-scipy-connected-components/
# from scipy.sparse import csr_matrix
# import string
import sys

sys.setrecursionlimit(10**5 + 10)


def input():
    return sys.stdin.readline().strip()


def resolve():
    N = int(eval(input()))
    A = [int(eval(input())) for i in range(N)]
    AA = Counter(A)
    cnt = 0
    for i in list(AA.values()):
        if i % 2 == 1:
            cnt += 1
    print(cnt)


resolve()

-from collections import Counter, deque +from collections import ( +    Counter, +    deque, +)  # https://note.nkmk.me/python-scipy-connected-components/ -# import numpy as np +# import numpy as np  # Pythonのみ！ +# import re +# from scipy.sparse.csgraph import connected_components  # Pythonのみ！ +# ↑cf.  https://note.nkmk.me/python-scipy-connected-components/ +# from scipy.sparse import csr_matrix +# import string -# input = sys.stdin.readline + + +def input(): +    return sys.stdin.readline().strip() + +