#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <utility>
#include <sstream>
#include <iostream>
#include <cmath>
#include <cstdlib>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <climits>
#include <time.h>
#include <math.h>
#define all(c) (c).begin(),(c).end()
#define tr(c,i) for(typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define ll long long
#define sz(a) int((a).size())
#define pb push_back
#define SORT(x) sort((x).begin(),(x).end());
#define VI vector<int>
#define VII vector < vector <int> >
#define MP make_pair
#define SET(x,byte) memset(x,byte,sizeof(x));
#define I(x) ((x) - 'A')
#define REP(i,mx) for(int i=0;(i)<(mx);i++)
#define FOR(i,mn,mx) for(int i=mn;(i)<=(mx);i++)
#define U(x) (1<<(x))
#define INF 1000000000
#define PI acos(-1.0)
#define endl '\n'

using namespace std;

int main() {
	int num, temp;
	VI vi(5,0);
	cin>>num;
	while(num--) {
		cin>>temp;
		temp--;
		vi[temp]++;
	}

	int mx = -1, ind = -1;

	REP(i, 5) {
		if(vi[i] > mx) {
			ind = i, mx = vi[i];
		}
	}
	cout<<ind+1<<endl;
	return 0;
}