include <bits/stdc++.h>

define ll long long int

define ld long double

using namespace std; int main(){

ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll n, m, k;
cin>>n;
m = n;
set<ll>s;
while(n--){
    cin>>k;
    if(s.count(k) > 0){
        s.erase(k);
    }
    else{
        s.insert(k);
    }
}
cout<<s.size();

} //TECHNOBLADE NEVER DIES

include "bits/stdc++.h"

// by aydin_thebest

define intt long long

define F first

define S second

define vs vector <string>

define vi vector <int>

define vil vector <intt>

define fast_io ios_base::syncwithstdio(0);cin.tie(0);cout.tie(0);

define pb push_back

define endl "\n"

define pii pair<int,int>

define pss pair<string, string>

define all(v) (v).begin(), (v).end()

define rall(v) (v).rbegin(), (v).rend()

const int sz = 2e5 + 5; const int mod = 1e9 + 7; const int MAXN = 1e5 + 5; const int INF = 1e9 + 5; const double PI = acos(-1.0); using namespace std; multiset<int> ms; stack <int> st; queue <int> q; int i, j; void solve(){ int n; cin >> n; vi v(n); for(i = 0; i < n; i++) cin >> v[i]; map <int, int> mp; for(i = 0; i < n; i++){ mp[v[i]]++; } int cnt = 0; for(auto i : mp){ if(i.second%2==1) cnt++; } cout << cnt << endl; } signed main() { fast_io; int t = 1; while(t--) { solve(); } cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n"; return 0; }

include <bits/stdc++.h>

using namespace std;

int main() { int n,i,j,k=0,say=0; cin>>n; int a[n];

for(i=0;i<n;i++){
    cin>>a[i];
}

sort(a,a+n);

for(i=0;i<n-1;i++){
    if(a[i]==a[i+1]){
        k++;
    }
    else{
        k=k+1;
        say=say+(k%2);
        k=0;
    }
}

if(a[n-1]!=a[n-2])
say++;

cout<<say;


return 0;

}