#include <iostream>
#include <vector>

#define LEVEL_SIZE 6

int most_sloved_problem (int array[6])
{
    int num=0,max=array[0];
    for(int i=0; i<LEVEL_SIZE-1; i++) {
        if(max <= array[i+1]) {
            max=array[i+1];
            num = i+1;
        }
        else { continue; }
    }
    return num+1;
}

int main()
{
    using std::cin;
    using std::cout;
    using std::endl;
    
    int level[LEVEL_SIZE] = {0};
    int N,L;
    cin >> N;
    
    for(int i=0; i<N; i++) {
        cin >> L;
        level[L-1]++;
    }
    
    int most = most_sloved_problem(level);
    
    cout << most << endl;
    
    return 0;
}