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.HashSet;
import java.util.Scanner;

	public class Main {

		public static void main(String[] args) {

			Scanner sc = new Scanner(System.in);
			
			int n = sc.nextInt();
			long[] a = new long[n];
			HashSet<Long> h = new HashSet<Long>();
			
			for(int i=0;i<n;i++) {
				a[i] = sc.nextLong();
			}
			
			for(int i=0;i<n;i++) {
				if(h.contains(a[i])) {
					h.remove(a[i]);
				}else {
					h.add(a[i]);
				}
			}
			
			System.out.println(h.size());
			
	    }
		
		
	}
