You are playing the following game with Joisino.

* Initially, you have a blank sheet of paper.
* Joisino announces a number. If that number is written on the sheet, erase the number from the sheet; if not, write the number on the sheet. This process is repeated N times.
* Then, you are asked a question: How many numbers are written on the sheet now?



The numbers announced by Joisino are given as A_1, ... ,A_N in the order she announces them. How many numbers will be written on the sheet at the end of the game?

Constraints

* 1≤N≤100000
* 1≤A_i≤1000000000(=10^9)
* All input values are integers.

Input

Input is given from Standard Input in the following format:


N
A_1
:
A_N


Output

Print how many numbers will be written on the sheet at the end of the game.

Examples

Input

3
6
2
6


Output

1


Input

4
2
5
5
2


Output

0


Input

6
12
22
16
22
18
12


Output

2
import java.util.HashMap;
import java.util.Map;
import java.util.Optional;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        Map<Long, Long> map = new HashMap<>();

        for(int i = 0;i < n;i++) {
            long ai = sc.nextLong();
            Optional<Long> value = Optional.ofNullable(map.get(ai));
            if(value.isPresent()) map.put(ai, value.get() + 1);
            else map.put(ai, 1L);
        }

        
        System.out.println(map.keySet().stream().mapToLong(map::get).filter(e -> e % 2 == 1).count());
    }

}
