#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;


int main() {

    int N;
    cin >> N;
    vector<int> v(6, 0);

    for (int i = 0; i < N; ++i) {
        int L;
        cin >> L;
        v[L - 1] += 1;
    }

    int res = 0;
    int m = v[res];

    for (int i = 1; i < 6; ++i) {
        if (v[i] >= m) {
            m = v[i];
            res = i;
        }
    }

    cout << res + 1 << endl;

    return 0;
}