import Control.Monad
import Control.Applicative
import Data.List


main :: IO()
main = do
  n <- readLn :: IO Int
  lst <- replicateM n readLn :: IO [Int]
  let l = (foldl (\x -> \y -> x + ((length y) `mod` 2)) 0  . splitBySame) lst
  print  l



splitBySame ::  (Ord a) => [a] -> [[a]]
splitBySame [] = []
splitBySame list = let (x:xs) = sort list; (lst, rest) = split x [] xs in lst : splitBySame rest
    where
      split :: (Ord a) => a -> [a]-> [a] -> ([a], [a])
      split n acc [] = (n:acc, [])
      split n acc (x:xs)
                  | n == x = split n (x:acc) xs
                  | n /= x = (n:acc, x:xs)
