#include<bits/stdc++.h>
using namespace std;
int main(void){
int n,z;cin>>z>>n;
pair<int,int> mi;
mi.first = 150;
int x[n],y[104]={0};
for(int i=0;i<n;i++)
    {cin>>x[i];
    y[x[i]]=1;}
for(int i=0;i<104;i++)
    if(y[i]==0&&mi.first>abs(z-i))
        mi=make_pair(abs(z-i),i);
cout<<mi.second<<endl;
return 0;}

### Prompt

Develop a solution in Cpp to the problem described below:

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>
using namespace std;
int main(void){
int n,z;cin>>z>>n;
pair<int,int> mi;
mi.first = 150;
int x[n],y[104]={0};
for(int i=0;i<n;i++)
    {cin>>x[i];
    y[x[i]]=1;}
for(int i=0;i<104;i++)
    if(y[i]==0&&mi.first>abs(z-i))
        mi=make_pair(abs(z-i),i);
cout<<mi.second<<endl;
return 0;}

```