P1469 找筷子(2进制操作)

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 2000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)


int n;
int s[MAXN];
int ans;
int main(){
	scanf("%d",&n);
	int t;
	for(int i=1;i<=n;i++){
		scanf("%d",&t);
		ans^=t;
	}
	printf("%d",ans);
	return 0;
}