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];
	    int[] count = {0,0,0,0,0};
	    
	    for(int types_i=0; types_i < n; types_i++){
	        types[types_i] = in.nextInt();
	    }
	    
	    for(int i=0;i<types.length;i++){
	    	count[types[i]-1]++;
	    }
	    int max = count[0];
	    int maxIndex = 0;
	    
	    for(int i=0;i<5;i++){
	    	if(count[i]>max){
	    		max = count[i];
	    		maxIndex = i+1;
	    	}
	    }
	    
	    System.out.println(maxIndex);
	    
	    in.close();
	}
}