大大的位运算

#include<queue>
#include<math.h>
#include<stdio.h>
#include<iostream>
#include<vector>
#include<iomanip>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<utility>
#include<cstring>
#include<stack>
#include<fstream>
#include <sstream>
#include<string>
#include<stdlib.h>
using namespace std;
#define ll long long
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
unsigned int n , x , ans;
int main()
{
    cin >> n;
    for ( int i = 1 ; i <= n - 1 ; i++ )
    {
        cin >> x;
        ans ^= x;
        ans ^= i;
    }
    ans ^= n;
    cout << ans;
    return 0;
}