#include <bits/stdc++.h>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int main(){
    int n;
    cin >> n;
    vector<int> bird(n);
    vector<int> types(5);
    
    for(int i = 0; i < n; i++){
       cin >> bird[i];
    }
    for(int i = 1; i <= 5; i++){
       types[i] = count(bird.begin(), bird.end(), i);
    }
    int max = 0, place = 0;
    for(int i = 1; i <= 5; i++){
      if(types[i] > max){
          max = types[i];
          place = i;
      }
    }
    
    //cout <<  *max_element(types.begin(), types.end()) << endl;
    cout <<  place << endl;
    return 0;
}