#include <iostream>
#include <math.h>
using namespace std;
 
const int MAXN = 1000001;  // Maximum possible value for elements in the array
 
int mark[MAXN];  // Frequency array to count occurrences of each element
int a[MAXN];    
 
int main(){
    int n;
    cin >> n;  // Read the number of elements in the array
 
    // Loop to read the input array and increment the count in the mark array
    for(int i = 1; i <= n; i++) {
        cin >> a[i];  
        mark[a[i]]++;  // Increment the count for the element in the mark array
    }
 
    int ans = 0;  // Variable to store the maximum frequency found
 
    // Loop to find the maximum frequency
    for(int i = 1; i <= n; i++) {
        ans = max(ans, mark[a[i]]);  // Update the maximum frequency
    }
 
    // Loop to find the first element with the maximum frequency
    for(int i = 1; i <= n; i++) {
        if(mark[a[i]] == ans) {  // Check if the current element has the max frequency
            cout << a[i];  // Output the element with the maximum frequency
            break;  // Stop after finding the first element with the maximum frequency
        }
    }
 
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8bWF0aC5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKY29uc3QgaW50IE1BWE4gPSAxMDAwMDAxOyAgLy8gTWF4aW11bSBwb3NzaWJsZSB2YWx1ZSBmb3IgZWxlbWVudHMgaW4gdGhlIGFycmF5CgppbnQgbWFya1tNQVhOXTsgIC8vIEZyZXF1ZW5jeSBhcnJheSB0byBjb3VudCBvY2N1cnJlbmNlcyBvZiBlYWNoIGVsZW1lbnQKaW50IGFbTUFYTl07ICAgIAoKaW50IG1haW4oKXsKICAgIGludCBuOwogICAgY2luID4+IG47ICAvLyBSZWFkIHRoZSBudW1iZXIgb2YgZWxlbWVudHMgaW4gdGhlIGFycmF5CgogICAgLy8gTG9vcCB0byByZWFkIHRoZSBpbnB1dCBhcnJheSBhbmQgaW5jcmVtZW50IHRoZSBjb3VudCBpbiB0aGUgbWFyayBhcnJheQogICAgZm9yKGludCBpID0gMTsgaSA8PSBuOyBpKyspIHsKICAgICAgICBjaW4gPj4gYVtpXTsgIAogICAgICAgIG1hcmtbYVtpXV0rKzsgIC8vIEluY3JlbWVudCB0aGUgY291bnQgZm9yIHRoZSBlbGVtZW50IGluIHRoZSBtYXJrIGFycmF5CiAgICB9CiAgICAKICAgIGludCBhbnMgPSAwOyAgLy8gVmFyaWFibGUgdG8gc3RvcmUgdGhlIG1heGltdW0gZnJlcXVlbmN5IGZvdW5kCiAgICAKICAgIC8vIExvb3AgdG8gZmluZCB0aGUgbWF4aW11bSBmcmVxdWVuY3kKICAgIGZvcihpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKSB7CiAgICAgICAgYW5zID0gbWF4KGFucywgbWFya1thW2ldXSk7ICAvLyBVcGRhdGUgdGhlIG1heGltdW0gZnJlcXVlbmN5CiAgICB9CgogICAgLy8gTG9vcCB0byBmaW5kIHRoZSBmaXJzdCBlbGVtZW50IHdpdGggdGhlIG1heGltdW0gZnJlcXVlbmN5CiAgICBmb3IoaW50IGkgPSAxOyBpIDw9IG47IGkrKykgewogICAgICAgIGlmKG1hcmtbYVtpXV0gPT0gYW5zKSB7ICAvLyBDaGVjayBpZiB0aGUgY3VycmVudCBlbGVtZW50IGhhcyB0aGUgbWF4IGZyZXF1ZW5jeQogICAgICAgICAgICBjb3V0IDw8IGFbaV07ICAvLyBPdXRwdXQgdGhlIGVsZW1lbnQgd2l0aCB0aGUgbWF4aW11bSBmcmVxdWVuY3kKICAgICAgICAgICAgYnJlYWs7ICAvLyBTdG9wIGFmdGVyIGZpbmRpbmcgdGhlIGZpcnN0IGVsZW1lbnQgd2l0aCB0aGUgbWF4aW11bSBmcmVxdWVuY3kKICAgICAgICB9CiAgICB9CgogICAgcmV0dXJuIDA7Cn0K

NgoxIDIgMSAyIDQgMg==

6
1 2 1 2 4 2