#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<math.h>
#include<stack>
using namespace std;
int main(void){
    int N; cin >> N;
    vector<int> v;
    int maxV = 0, c;
    int ans = 0;
    for(int i = 0; i < N;i++){
        cin >> c;
        v.push_back(c);
    }
    sort(v.begin(), v.end());
    for(int i = 1; i <= 6; i++){
        if(maxV <= count(v.begin(), v.end(), i)){
            maxV = count(v.begin(), v.end(), i);
            ans = i;
        }
    }
    if(maxV == 1) {
        cout << v[N-1] << endl;
    }else{
    cout << ans << endl;
    }
    return 0;
}