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) { int[] countArr = new int[5]; 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(); countArr[types[types_i]-1] = countArr[types[types_i]-1] + 1; } // your code goes here int highestCount=-1; int highestIndex=-1; for(int i=0;i<5;i++){ if(highestCount < countArr[i]){ highestCount = countArr[i]; highestIndex = i; } } System.out.println(highestIndex+1); } }