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


int main() {
    int n;
    cin >> n;
    
    vector<int> counts(n+1);
    while (n--) {
        int val;
        cin >> val;
        counts[val]++;
    }
    
    int idx = 1;
    for (int i = 2; i < 6; i++) {
        if (counts[i] > counts[idx]) {
            idx = i;
        }
    }
    cout << idx << endl;
    return 0;
}