#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int n; cin >> n; int l[n]; int f[10] = {}; rep(i,n){ cin >> l[i]; f[l[i]]++; } int ma = 0; int arg = 0; rep(i,10){ if(ma <= f[i]){ ma = f[i]; arg = i; } } cout << arg << endl; return 0; }