#include <bits/stdc++.h>
#define ref(i,n) for(int i=0;i<n;i++)
using namespace std;

int a,b,c,d,e,p[101];

int main()
{
cin>>a>>b;
ref(i,b) {
    cin>>c;
    p[c]++;}
    ref(i,100){
        if(a-i<=0) {cout<<a-i;return 0;}
        else if(!p[a-i]){cout<<a-i;return 0;}
        if(!p[a+i]) {cout<<a+i;return 0;}
    }

    return 0;
}

### Prompt

Create a solution in CPP for the following problem:

Given are an integer X and an integer sequence of length N: p_1, \ldots, p_N.

Among the integers not contained in the sequence p_1, \ldots, p_N (not necessarily positive), find the integer nearest to X, that is, find the integer whose absolute difference with X is the minimum. If there are multiple such integers, report the smallest such integer.

Constraints

* 1 \leq X \leq 100
* 0 \leq N \leq 100
* 1 \leq p_i \leq 100
* p_1, \ldots, p_N are all distinct.
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


X N
p_1 ... p_N


Output

Print the answer.

Examples

Input

6 5
4 7 10 6 5


Output

8


Input

10 5
4 7 10 6 5


Output

9


Input

100 0


Output

100

### Response

```cpp
#include <bits/stdc++.h>
#define ref(i,n) for(int i=0;i<n;i++)
using namespace std;

int a,b,c,d,e,p[101];

int main()
{
cin>>a>>b;
ref(i,b) {
    cin>>c;
    p[c]++;}
    ref(i,100){
        if(a-i<=0) {cout<<a-i;return 0;}
        else if(!p[a-i]){cout<<a-i;return 0;}
        if(!p[a+i]) {cout<<a+i;return 0;}
    }

    return 0;
}

```