#include<bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
	int x, n; cin>>x>>n;
	set<int> st; 
	int t;
	for(int i=0;i<n;i++) cin>>t, st.insert(t);
	int i=x, j=x;
	int ans;
	while(true){
		if(st.find(i)==st.end()){
			 ans = i; break;
		}
		if(st.find(j)==st.end()){
			 ans = j; break;
		}
		i--; j++;
	}
	cout<<ans;
	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>
using namespace std;
#define ll long long

int main(){
	int x, n; cin>>x>>n;
	set<int> st; 
	int t;
	for(int i=0;i<n;i++) cin>>t, st.insert(t);
	int i=x, j=x;
	int ans;
	while(true){
		if(st.find(i)==st.end()){
			 ans = i; break;
		}
		if(st.find(j)==st.end()){
			 ans = j; break;
		}
		i--; j++;
	}
	cout<<ans;
	return 0;
}


```