#include <cstdio>
#include <algorithm>
using std::sort;
int main(void)
{
int i,N,ptr,currCount,lastNum,res=0;
int *a;
scanf("%d",&N);
a=new int [N];
for(i=0;i<N;i++)
scanf("%d",a+i);
sort(a,a+N);
ptr=0;
while(ptr<N)
{
lastNum=a[ptr];
currCount=0;
while(ptr<N && a[ptr]==lastNum)
{
currCount++;
ptr++;
}
res+= currCount%2;
}
printf("%d\n",res);
delete [] a;
return 0;
}