#include <iostream>

#include <memory.h>

#include <string>

#include <istream>

#include <sstream>

#include <vector>

#include <stack>

#include <algorithm>

#include <map>

#include <queue>

#include <math.h>

#include <cstdio>

using namespace std;

typedef long long LL;

const int MAXN = 1e5 + 10;

const int INF = 0x7fffffff;

int main()

{

    int n;

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

    //while (cin >> n)

    {

        int cnt = 0,a,vis;

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

        {

            scanf("%d", &a);

            if (cnt == 0)

            {

                vis = a;

                cnt++;

            }

            else

            {

                if (a == vis)

                    cnt++;

                else

                    cnt--;

            }

        }

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

    }

    return 0;

}