stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

#include<string.h>

#include<cstdio>

#include<map>

using namespace std;





int main(){



   int n, l, r;

   while(cin >> n){

      map<int, int> mp;

      //memset(flag, 0, sizeof(flag));

      int a;

      int cnt = 0;

      for(int i = 0; i < n; ++i){

         int a;cin >> a;

         mp[a]++;

         if(mp[a] & 1){

            cnt++;

         }else{

            cnt--;

         }

      }

      cout << cnt <<endl;

   }





   return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.291361441313472x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include <iostream>

#include <set>

using namespace std;



int main(){



    int n;

    set<int> a;

    int x;

    cin >> n;

    for(int i=0;i<n;i++){

        cin >> x;

        if(!a.insert(x).second)

            a.erase(x);

    }

    cout << a.size() << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.281138392490401x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

#include<map>

using namespace std;

int a[100010];

int main()

{

	int n,i,num=0,k=1;

	cin>>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=(k+1)%2;

		else

		{

			num+=k;

			k=1;

		}

	}

	if(k%2==1)

	  num+=1;

	cout<<num<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.228199189771766x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>

#include<set>

using namespace std;

typedef long long ll;

set<ll>s;

int main()

{

    int n;

    cin>>n;

    for(int i = 0; i < n; i++){

        ll t;

        cin>>t;

        if(s.count(t))s.erase(s.find(t));

        else s.insert(t);

    }

    cout<<s.size();

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.24478143461058x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include<iostream>

#include<map>

using namespace std;

map<int,int>mp;

int main()

{

	int n,t,ans=0;

	cin >> n;

	for(int i=0;i<n;i++)

	{

		cin >> t;

		if(mp[t]==0)

		{

			mp[t]=1;

			ans++;

		}

		else

		{

			mp[t]=0;

			ans--;

		}

	}

	cout << ans;

}

// Faster C++ solution for the same problem (measured speedup: 5.240069806024195x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

int n;

map<int,int> mp;

int main(){

    while(~scanf("%d",&n)){

        mp.clear();

        for(int i = 0; i < n; i++){

            int id;

            scanf("%d",&id);

            if(!mp.count(id)){

                mp[id] = 1;

            }

            else{

                mp[id] = mp[id] ^ 1;

            }

        }

        int ans = 0;

        for(auto it : mp){

            if(it.second == 1) ans++;

        }

        printf("%d\n",ans);

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.225735274271916x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<math.h>

#include<string.h>

#include<iostream>

#include<algorithm>

#include<vector>

#include<utility>

#include<stack>

#include<queue>

#include<map>



#define se second



using namespace std;



map<int,int> mp;



int main()

{

    //    freopen("input.in", "r", stdin);

    

    int n; cin >> n;

    int hit = 0;

    while(n--)

    {

        int a;

        cin >> a;

        mp[a]++;

    }

    

    

    for(auto x : mp)

        if(x.se&1)

            hit++;

    

    cout << hit << "\n";

}


// Faster C++ solution for the same problem (measured speedup: 5.250449038482036x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

#define fi first

#define se second

#define pb push_back

#define eb emplace_back

using namespace std;

typedef long long LL;

typedef pair<int,int> pii;

typedef vector<int> vi;



template<class T> inline T re(){

	T N = 0; char c = getchar(); bool neg = 0;

	for (; c < '0' || c > '9'; c = getchar()) neg |= c == '-';

	for (; c >= '0' && c <= '9'; c = getchar())

		N = (N<<3)+(N<<1) + c - '0';

	return neg ? -N : N;

}



int n;

set<int> s;



int main(){

	n = re<int>();

	for (int i = 1; i <= n; i++){

		int u = re<int>();

		if (s.find(u) != s.end()){

			s.erase(u);

		} else {

			s.insert(u);

		}

	}

	cout << s.size() << '\n';

	return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.17973773338479x):
#include<stdio.h>

#include<algorithm>



using namespace std;



int ar[100005];



int main() {

  int n;

  scanf("%d", &n);

  for (int i = 0; i < n; i++) {

    scanf("%d", &ar[i]);

  }

  sort(ar, ar + n);

  int ans = 0;

  int j = 0;

  for (int i = 0; i < n; i++) {

    if (i && ar[i] != ar[i-1]) {

      if (j % 2) {

        ans++;

      }

      j = 0;

    }

    j++;

  }

  if (j % 2) ans++;

  printf("%d\n", ans);

  return 0;

}
// Slower C++ solution:
#include <iostream>

#include<algorithm>

using namespace std;



int *n;

int ans=0;

int N,i;



int main(){

	cin>>N;

	n=new int[N];

	for(int i=0; i<N; ++i){

		cin>>n[i];

	}



	sort(n,n+N);



	while(i<N){

		int cnt=0,next=n[i];

		while(i<N && n[i]==next){

			cnt++;

			i++;

		}

		ans+=cnt%2;

	}



	cout<<ans<<endl;

	delete[]n;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.676732081309696x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#pragma GCC optimize("O2")

#pragma G++ optimize("O2")

#include<cstdio>

#include<algorithm>

#include<map>

#define ll long long

#define For(i,x,y)  for(ll i=x;i<=y;++i)

#define FOr(i,x,y)  for(ll i=x;i>=y;--i)

#define lf else if

using namespace std;

inline ll read(){   ll x=0,f=1;char ch=getchar();   while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}  while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}  return x*f; } 

inline void write(ll x){    if (x<0) putchar('-'),x=-x; if (x>=10) write(x/10);   putchar(x%10+'0');  } 

inline void writeln(ll x){ write(x);   puts("");   }

map<ll,ll>mp;

ll n,ans;

int main(){

	n=read();

	For(i,1,n){

		ll x=read();

		if (mp[x])	mp[x]^=1,ans--;

		else	mp[x]^=1,ans++;

	}writeln(ans);

}

// Faster C++ solution for the same problem (measured speedup: 4.299679742463072x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

#define ll long long

#define N 2005

#define oo 1000000000

#define zyy 1000000007

#define For(i,x,y) for(int i=x;i<=y;i++)

#define Rep(i,x,y) for(int i=x;i>=y;i--)

#define Forn(i,x,y) for(int i=x;i<y;i++)

using namespace std;

inline int read(){

	int x=0,f=0;char ch=getchar();

	for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=1;

	for(;ch>='0'&&ch<='9';ch=getchar()) x=(x<<1)+(x<<3)+ch-48;

	return f?-x:x;

}

set<int> s;

int n;

int main(){

	n=read();

	For(i,1,n){

		int x=read();

		if(s.find(x)==s.end()) s.insert(x);

		else s.erase(x);

	}

	cout<<s.size();

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.651810563497826x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<map>

using namespace std;



int main()

{

	map<int, bool> mp;

	int n;

	scanf("%d",&n);

	for (int i = 0; i < n; i++)

	{

		int temp;

		scanf("%d", &temp);

		if (mp[temp])

			mp.erase(temp);

		else

			mp[temp] = true;



	}

	cout << mp.size();

	return EXIT_SUCCESS;

}

// Faster C++ solution for the same problem (measured speedup: 4.666451990758471x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <algorithm>

#include <vector>

#include <list>

#include <climits>

#include <queue>

#include <string>

#include <map>

#include <stack>

#include <cmath>

#include <regex>

#include<ctime>

#include<set>

using namespace std;

int main()

{

ios::sync_with_stdio(false);

int n;

cin>>n;

set<int> s;

while(n--)

{

    int t;

    cin>>t;

    auto it=s.find(t);

    if(it!=s.end())

        s.erase(t);

    else

        s.insert(t);

}

cout<<s.size()<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 4.764408244376664x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <set>

using namespace std;



int main(void){

	int n;

	scanf("%d",&n);

	set<long long> ss;

	long long cnt;

	for(int i=0;i<n;i++){

		cin>>cnt;

		if(ss.find(cnt)!=ss.end()) ss.erase(cnt);

		else ss.insert(cnt);

	}

	printf("%d",ss.size());

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.6826619969624845x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include <cstdio>

#include <map>

using namespace std;



map<long long, bool> mp;

int main()

{

	int n, cnt = 0;

	long long id;

	scanf("%d", &n);

	for(int i = 0; i < n; i++)

	{ 

		scanf("%lld", &id);

		if (mp.find(id) == mp.end())

		{

			mp[id] = true;

			cnt++;

		}

		else

		{

			if (mp[id] == true)

			{

				mp[id] = false;

				cnt--;

			}

			else

			{

				mp[id] = true;

				cnt++;

			}

		}

	}

	printf("%d", cnt);

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.325454844423898x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>  

#include <cstring> 

#include <cmath> 

#include <string> 

#include <vector> 

#include <set>   

#include <map>

#include <queue> 

#include <stack> 

#include <algorithm> 



using namespace std;



int main(int argc,char* argv[])

{

    int N;

    map<string,int> mp;

    string str;

    scanf("%d",&N);

   

    for(int i=0;i<N;i++)

    {

        cin>>str;

        if(mp[str]==0)

          mp[str] = 1;

        else

          mp[str] = 0;

    }

    

    map<string,int>::iterator it = mp.begin();

    int cnt = 0;

    for( ;it!=mp.end();it++)

    {

    	if(it->second!=0)

    	  cnt++;

    }

    

    printf("%d",cnt);

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 4.718939010110972x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<map>

#include<cstdio>

#include<cstring>

#include<algorithm>

#include<set> 

#include<stack>

using namespace std;



map<int,int> mp;

int main(){

int n;

cin>>n;

for(int i=0;i<n;i++)

{   int temp;

    cin>>temp;

	if(mp.find(temp)==mp.end())

    mp[temp]=1;

    else if(mp[temp]==0)

    mp[temp]=1;

    else if(mp[temp]==1)

    mp[temp]=0; 

}

int count=0;

for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)

{

	if(it->second==1)

	count++; 

}

cout<<count;

return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.674592433549893x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<set>

using namespace std;



int main(){

	int n,a,num=0;

	set<int> s;

	scanf("%d",&n);

	while(n--){

		scanf("%d",&a);

		if(s.count(a)!=0){

			s.erase(a);

			num--;

		}

		else{

			s.insert(a);

			num++;

		}

	}

	printf("%d",num);

	return 0;

	system("pause");

}

// Faster C++ solution for the same problem (measured speedup: 4.655470272025986x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include<cstdio>

#include <string>

#include <map>

#include <algorithm>

using namespace std;







int main()

{

	map<int, int> record;

	int n;

	int x;

	cin >> n;

	while (n--)

	{

		cin >> x;

		if (record[x] == 0)

			record[x] = 1;

		else

			record[x] = 0;

	}

	int k = 0;

	for (auto it : record)

	{

		if (it.second == 1)

			k++;

	}

	cout << k << endl;

}


// Faster C++ solution for the same problem (measured speedup: 4.717191767028176x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

using namespace std;

int cmp(const void* a,const void* b){

	return *(const int*)a-*(const int*)b;

}

int main(){

	int n=0;

	cin>>n;

	int *a=new int[n];

    int count=0;

    int i=0;

	while(i<n){

	cin>>a[i++];

	}

	qsort(a,n,sizeof(int),cmp); 

	for(int i=0;i<n;i++){

		int temp=1;

		while(i<(n-1)&&a[i]==a[i+1]){

		   temp++;

		   i++;

	    }

		if(temp&0x01)count+=1 ;

	}

	cout<<count;

}

// Faster C++ solution for the same problem (measured speedup: 4.666251754634181x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<set>

using namespace std;

int main(){

	int n,cnt=0;

	cin>>n;

	set<int> people;

	set<int>::iterator it;

	for(int i=0;i<n;i++)

	{

		int t;

		cin>>t;

		it=people.find(t);

		if(it!=people.end())

			people.erase(it);

		else

			people.insert(t);

	}

	cout<<people.size();

    

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 4.704141618151414x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<map>

using namespace std;

int main()

{

    map<int,bool>mp;

    map<int,bool>::iterator it;

    long long cnt;

    int n,id;

   scanf("%d",&n);

    {

         cnt=0;

         mp.clear();

         while(n--)

         {

             scanf("%d",&id);

             it=mp.find(id);

             if(it==mp.end())

             {

                 mp.insert(make_pair(id,true));

                 cnt++;

             }

             else

             {

                 if(it->second)

                 {

                     it->second=false;

                     cnt--;

                 }

                 else

                 {

                     it->second=true;

                     cnt++;

                 }

             }



         }

    } printf("%lld\n",cnt);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.325593533996722x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

set<int> ss;

int main()

{

    int n,num;

    scanf("%d",&n);

    for(int i = 0; i < n; ++i)

    {

        scanf("%d",&num);

        if(ss.find(num) != ss.end())

            ss.erase(num);

        else

            ss.insert(num);

    }

    cout << ss.size() << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 4.674324374704325x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}
// Slower C++ solution:
#include<stdio.h>

#include<string.h>

#include<stdlib.h>

#include<iostream>

#include<algorithm>

#include<string>

#include<map>

#include<set>

#define maxn 1005

using namespace std;

typedef long long  LL;

map<string,int>mp;

int main()

{

    int n;

    scanf("%d",&n);

    set<int>s;

    while(n--)

    {

        int t;

        scanf("%d",&t);

        if(s.count(t))

        {

            s.erase(t);

        }

        else

            s.insert(t);

    }

    cout<<s.size()<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 4.673068777450727x):
#include<stdio.h>

#include<algorithm>

using namespace std;

int main()

{

    int n,j=0;

    long long a[100005];

    scanf("%d",&n);

    for(int i=0;i<n;i++)

        scanf("%lld",&a[i]);

    sort(a,a+n);

    for(int i=0;i<n;)

    {

        if(a[i]!=a[i+1])

        {

            i++;

            j++;

        }

        else

            i+=2;

    }

    printf("%d\n",j);

    return 0;

}