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.Arrays;
import java.util.Scanner;
public class Main {

	static int gcd (int a, int b) {return b>0?gcd(b,a%b):a;}
	static int lcm (int a, int b) {return a*b/gcd(a,b);}

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner scan=new Scanner(System.in);
		int b=scan.nextInt();
		int a[]=new int[b];
		for(int i=0;i<b;i++) {
			a[i]=scan.nextInt();
		}
		Arrays.sort(a);
		int co=0;
		int ans=0;
		for(int i=1;i<b;i++) {
			if(a[i]==a[i-1]) {
				co++;
			}
			else {
				if(co%2==0) {
					ans++;
				}
				co=0;
			}
		}
		if(co%2==0) {
			ans++;
		}
		System.out.println(ans);
	}

}
