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[] t = {0,0,0,0,0};
        int lar =0;
        int lar_type=0;
        for(int types_i=0; types_i < n; types_i++){
            types[types_i] = in.nextInt();
        }
        // your code goes here
        
        for(int types_j=0; types_j < types.length;types_j++)
            {
              switch (types[types_j])
                  {
                  case 1: t[0]++; break;
                  case 2: t[1]++; break;
                  case 3: t[2]++; break;
                  case 4: t[3]++; break;
                  case 5: t[4]++; break;
              }
        }
        for (int x=0;x<5;x++)
            {
            
            if(t[x]>lar)
                {
                lar = t[x];
                lar_type = x+1;
            }
        }
       System.out.println(lar_type);
    }
}