#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int n;
    int ls[6];
    fill(ls,ls+6,0);
    cin >> n;
    for (int i = 0; i < n; i++) {
        int l;
        cin >> l;
        ls[l-1]++;
    }
    int mx = *max_element(ls,ls+6);
    for (int i = 6; i >= 1; i--) {
        if (ls[i-1] == mx) {
            cout << i << endl;
            break;
        }
    }
    return 0;
}