#include<iostream>
#include<cstring>
#include<queue>
#include<map>
#include<cstdio>
#include<stack>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
const int maxn=1e3+7;
#define INF 0x3f3f3f3f
#define IO ios::sync_with_stdio(false);\
    cin.tie(0);\
    cout.tie(0);
map<int,int>mp;
int main()
{
    IO;
    int n,t;
    cin>>n;
    for(int i=0;i<n;i++)
    {
        cin>>t;
        if(mp.find(t)!=mp.end())
        {
            mp.erase(t);
//            cout<<"pass"<<endl;
        }
        else
        {
            mp[t]=1;
        }
    }
    cout<<mp.size()<<endl;
    return 0;
}
