import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] types = new int[n];
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
        }
        int[] counts = new int[6];
        int max = 0;
        int mindex = 0;
        for(int j=0;j<n;j++){
            counts[types[j]] += 1;
            //System.out.println(types[j] + ":" + counts[types[j]]);
            if(counts[types[j]] > max){
                max = counts[types[j]];
                mindex = types[j];
            }
            else if (counts[types[j]] == max){
                if(types[j] < mindex)
                    mindex = types[j];
            }
            
        }
        
        System.out.println(mindex);
        
    }
}