
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) {
        int x = sc.nextInt();
        int n = sc.nextInt();

        if(n == 0){
            System.out.println(x);
            return;
        }else {

            List<Integer> p = new ArrayList<>();
            for (int i = 0; i < n; i++){
                p.add(sc.nextInt());
            }


            int minValue = Integer.MAX_VALUE;
            int ans = 101;
            for (int i = 0; i <= 101; i++) {
                for(int j = 0; j < n; j++) {
                    if(!p.contains(i)){
                        if (minValue > Math.abs(i - x)) {
                            minValue = Math.abs(i - x);
                            ans = i;
                        }
                    }
                }
            }

            System.out.println(ans);
        }
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz