#include <bits/stdc++.h>
#define LL long long
#define L long
#define I int
#define FOR(i,s,n) for(int i=s;i<n;i++)
#define FORR(i,n,s) for(int i=n-1;i>=s;i--)
#define max_size_segTree(n) 2*(int)pow(2, (int)(ceil(log2(n)))) - 1
#define m(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define pb push_back
#define MAX 1000000007
#define INF 1e18+1
using namespace std;
I ar[100] = {0};
int main()
{
    I n;
    cin>>n;
    I temp;
    while(n--){
        cin>>temp;
        ar[temp]++;
    }
    I ans = 0;
    I maxi = 0;
    FOR(i,0,6){
        if(maxi < ar[i]){
           maxi = ar[i];
            ans = i;
        }
    }
    cout<<ans<<endl;
    return 0;
}