#include <bits/stdc++.h>
#include <algorithm>

using namespace std;

void disp_vec (int i) {
  cout << i << ' ';
}

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<int> birds(5, 0);
    for (int i = 0; i < n; i++) {
        birds[types[i] - 1]++;
    }
    
//    for_each (birds.begin(), birds.end(), disp_vec);
//    cout << endl;
    
    int it = distance(birds.begin(), max_element(birds.begin(), birds.end())) + 1;
    cout << it;
    
    return 0;
}