#include <iostream>
#include <math.h>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, d, n) for (int i = d; i < (int)(n); i++)
#define rRep(i,n) for(int i = n; i >= 0; i--)
#define rRep2(i,d,n) for(int i = n; i >= d; i--)
#define forEach(arr) for (auto& it:arr)


int main(void){
    
    int n;
    cin >> n;
    int m[6] = {0};
    
    rep(i,n) {
        int a;
        cin >> a;
        m[a - 1] += 1;
    }
    int max = 0;
    rep(i,6) {
        if(m[max] <= m[i])max = i;
    }
    cout << max + 1;
    
    
}