import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class MigratoryBirds {

	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		
		int number = scanner.nextInt();
		
		int types[] = new int[number];
		
		
		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		for (int i=0;i<number;i++){
			types[i] = scanner.nextInt();
			if (!map.containsKey(types[i])) map.put(types[i], 1);
			else map.put(types[i], map.get(types[i])+1);
		}
		
		int maxIndex = -1;
		int maxValue = 0;
		
		for (Map.Entry<Integer, Integer> entry: map.entrySet()){
			if (entry.getValue()>maxValue){
				maxValue = entry.getValue();
				maxIndex = entry.getKey();
			}
		}
		
		System.out.println(maxIndex);
		scanner.close();
	}
}