前面的数据会冗余的
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val) memset(arr, val, sizeof(arr))
typedef long long LL;
const int MAXN = 1010;
const int MAXM = 20000;
const int INF = 0x3f3f3f3f;
const LL mod = 10000007;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int main()
{
int n,x;
while(cin>>n)
{
int cnt=0,num=0;
while(n--)
{
scanf("%d",&x);
if(cnt==0)
num=x,cnt++;
else
{
if(num==x)
cnt++;
else cnt--;
}
}
cout<<num<<endl;
}
return 0;
}