#include<iostream>
#include<string>
#include<vector>
#include<algorithm>

using namespace std;

bool compfn(pair<int,int> const&x,pair<int,int> const& y){return x.second < y.second;}

int max(vector<pair<int,int>> count)
{
    int max = 0;
    int ret = 0;
    for(int i = 0;i<count.size();i++)
    {
        if(count[count.size()-1-i].second >= max)
        {
            max = count[count.size()-1-i].second;
            ret = count[count.size()-1-i].first;
        }
    }
    return ret;
}
int main()
{
    int n;
    cin >> n;
    vector<int> types(n);
    for(int types_i = 0; types_i < n; types_i++){cin >> types[types_i];}
    vector<pair<int,int>> count;
    for(int i = 1;i<=5;i++){count.push_back(make_pair(i,0));}
    for(int i = 0;i<types.size();i++){count[types[i]-1].second++; }
    sort(count.begin(),count.end(),compfn);
    cout<<max(count);

}