#include<bits/stdc++.h>
using namespace std;
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define ll long long

int main() {
	int n;
	scanf("%d", &n);
	int arr[n + 1];
	map<int, int> mp;
	for (int i = 0; i < n; i++) {
		scanf("%d", &arr[i]);
		if (mp[arr[i]] == 0) mp[arr[i]] = 1;
		else mp[arr[i]] = 0;
	}
	long long ans = 0;
	for (auto c : mp){
		ans += c.second;
	}
	printf("%lld" , ans);
}

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

int main(){
    int n;
    cin>>n;
    int a[n];
    int x;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    sort(a,a+n);
    int tmp=0;
    int ans=0;
    while(tmp<n){
        int tmp2=a[tmp];
        int cnt=0;
        while(tmp<n&&a[tmp]==tmp2){
            tmp++;
            cnt++;
        }
        ans+=cnt%2;
    }
    cout<<ans<<endl;
    return 0;
}