#include <iostream>
using namespace std;
 
int main() {
	int n;
	cin >> n;
	int v[n] = {};
	int freq[n] = {};
	for(int i = 0; i < n; i++)
		{
			cin >> v[i];
			freq[v[i]]++;
		}
 
	int mx = 0;
	int index = 0; //as there will be always a majority number
				   //so then no worry cause the index value will always change
				   //and if it stay zero then the majority element is zero
	for(int i = 0; i < n; i++)
	{
		if(mx != max(mx , freq[i]))
		{
			mx = max(mx , freq[i]);
			index = i;
		}
	}
	cout << index << endl;	
	return 0;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CglpbnQgbjsKCWNpbiA+PiBuOwoJaW50IHZbbl0gPSB7fTsKCWludCBmcmVxW25dID0ge307Cglmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKQoJCXsKCQkJY2luID4+IHZbaV07CgkJCWZyZXFbdltpXV0rKzsKCQl9CgkKCWludCBteCA9IDA7CglpbnQgaW5kZXggPSAwOyAvL2FzIHRoZXJlIHdpbGwgYmUgYWx3YXlzIGEgbWFqb3JpdHkgbnVtYmVyCgkJCQkgICAvL3NvIHRoZW4gbm8gd29ycnkgY2F1c2UgdGhlIGluZGV4IHZhbHVlIHdpbGwgYWx3YXlzIGNoYW5nZQoJCQkJICAgLy9hbmQgaWYgaXQgc3RheSB6ZXJvIHRoZW4gdGhlIG1ham9yaXR5IGVsZW1lbnQgaXMgemVybwoJZm9yKGludCBpID0gMDsgaSA8IG47IGkrKykKCXsKCQlpZihteCAhPSBtYXgobXggLCBmcmVxW2ldKSkKCQl7CgkJCW14ID0gbWF4KG14ICwgZnJlcVtpXSk7CgkJCWluZGV4ID0gaTsKCQl9Cgl9Cgljb3V0IDw8IGluZGV4IDw8IGVuZGw7CQoJcmV0dXJuIDA7Cn0=

NQoxIDIgMiA0IDI=

5
1 2 2 4 2