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 count[]={0,0,0,0,0,0};
        for(int i=0;i<n;i++)
            {
            switch(types[i])
                {
                case 1:count[0]++;break;
                case 2:count[1]++;break;
                case 3:count[2]++;break;
                case 4:count[3]++;break;
                case 5:count[4]++;break;
            }
            
        }
        int max=count[0];
        int mintype=0;
        for(int i=0;i<5;i++)
            if(count[i]>max)
            {
              max=count[i];
              mintype=i;
        }
        for(int a=0;a<5;a++)
        {
        if(a!=mintype){
            if(count[a]==count[mintype])
            {
                if(mintype>a){
                    mintype=a;
                }
            }
        }
    }
        System.out.print(mintype+1);
    }
    
}