import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class mmm {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int numbercount = Integer.parseInt(scanner.nextLine());

        int position = 1;
        int[] numbers = new int[numbercount];
        int[] duplicates = new int[numbers.length];
        int min = 11;

        for (int i = 0; i < numbercount; i++) {
            numbers[i] = scanner.nextInt();
            if (numbercount < 2) {
                System.out.println(numbers[i]);
                return;
            }
        }

        for (int j = 0; j < numbercount; j++) {
            for (int k = position; k < duplicates.length; k++) {
                if (numbers[j] == numbers[k]) {
                    duplicates[j] = numbers[k];
                    break;
                }
            }
            position++;
        }

        for (int i = 0; i < duplicates.length; i++) {
            if (duplicates[i] < min && duplicates[i] != 0) {
                min = duplicates[i];
            }
        }

        if (numbercount < 1) {
            System.out.println();
        } else {
            System.out.println(min);

        }


    }
}