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 = new int[n][1];
    for (int types_i = 0; types_i < n; types_i++){
      types[types_i] = in.nextInt();
      Arrays.fill(count[types_i], 0);
    }
    for (int i = 0; i < n; i++) {
      count[types[i] - 1][0]++;
    }
    int max = -1, lar = 0;
    for (int i = 0; i < 6; i++) {
      if (count[i][0] > lar) {
        lar = count[i][0];
        max = i;
      }
    }
    System.out.println(max + 1);
  }
}