#include <iostream>
#include <math.h>
using namespace std;

bool cnt[106];
int main() {
	int n, x;
	cin >> x >> n;
	for(int i = 0, y; i < n; ++i)
		cin >> y, cnt[y] = 1;
	int ans = x, cur = 1e9;
	for(int i = 0; i < 205; ++i) {
		if(cnt[i])
			continue;
		if(abs(x - i) < cur)
			cur = abs(x - i), ans = i;
	}
	cout << ans;
}

### Prompt

Please provide a Cpp coded solution 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 <iostream>
#include <math.h>
using namespace std;

bool cnt[106];
int main() {
	int n, x;
	cin >> x >> n;
	for(int i = 0, y; i < n; ++i)
		cin >> y, cnt[y] = 1;
	int ans = x, cur = 1e9;
	for(int i = 0; i < 205; ++i) {
		if(cnt[i])
			continue;
		if(abs(x - i) < cur)
			cur = abs(x - i), ans = i;
	}
	cout << ans;
}

```