/////////// <----------------------  Xorcestor_X ---------------------> ///////////
#include <bits/stdc++.h>
#include <sstream>
#include <algorithm>
#include <map>
#include <iterator>
#include <queue>
#include <utility>
#include <set>
#include <deque>

using namespace std;
#define endl "\n"
#define ll long long int
#define c(x) ll x;cin>>x
#define cc(x,y) ll x,y;cin>>x>>y
#define ccc(x,y,z) ll x,y,z; cin>>x>>y>>z
#define db long double
#define fast cin.tie(NULL); cout.tie(NULL); ios_base::sync_with_stdio(false)
#define inf 200000000000000
#define mod 1000000007
#define mod2 998244353
#define eps 1e-7
#define PI 3.1415926535897932385
#define pb push_back
#define bitc  __builtin_popcountll
#define mp make_pair
#define ff first
#define ss second
#define all(ar) ar.begin(), ar.end()
#define len(x) (ll)(x).size()
#define fr(i,a,b) for (ll i = (a), _b = (b); i <= _b; i++)
#define rep(i,n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i,n) for (ll i = n - 1; i >= 0; i--)
#define frr(i,a,b) for (ll i = (a), _b = (b); i >= _b; i--)
#define foreach(it,ar) for (auto it = ar.begin(); it != ar.end(); it++)
#define fill(ar,val) memset(ar, val, sizeof(ar))
#define print(arr,n) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n) cout<<arr[i]<<" "; cout<<endl
#define print2(arr,n,m) cout<<" :: "<<#arr<<" :: "<<endl; rep(i,n){ rep(j,m) cout<<arr[i][j]<<" "; cout<<endl; }
#define dyn1(arr,n) ll* arr=new ll[n]; rep(i,n) arr[i]=0;
#define dyn2(arr,n,m) ll** arr=new ll*[(n)]; rep(i,n) arr[i]=new ll[m]; rep(i,n) rep(j,m) arr[i][j]=0
#define carr(arr,n) rep(i,n) cin>>arr[i]
#define carr2(arr,n,m) rep(i,n) rep(j,m) cin>>arr[i][j]
#define debug(a) cout<<" :: "<<#a<<" == "<<a<<endl
#define debug2(a,b) cout<<" :: "<<#a<<" == "<<a<<" :: "<<#b<<" == "<<b<<endl
#define watch(x) cerr << (#x) << " is " << (x) << endl
typedef pair<ll,ll> pii;
typedef vector<pii> vii;

inline ll maxim(ll a,ll b) {if(a>b) return a; else return b;}
inline ll minim(ll a,ll b) {if(a<b) return a; else return b;}
inline bool equals(double a, double b){ return fabs(a - b) < 1e-9; }
ll gcd(ll a, ll b){ return b==0 ? a : gcd(b, a%b); }


ll Extended_gcd(ll a,ll b,ll& x,ll& y)
{
  if(a==0)
  {
    x=0;
    y=1;
    return b;
  }
  else
  {
    ll x1,y1;
    ll g=Extended_gcd(b%a,a,x1,y1);
    x=y1-(b/a)*x1;
    y=x1;
    return g;
  }
}

bool prime[1000010];
void SieveOfEratosthenes()
{
    memset(prime, true, sizeof(prime));
    prime[1]=false;
    for (int p=2; p*p<=1000001; p++)
    {
        if (prime[p] == true)
        {
            for (int i=p*p; i<=1000001; i += p)
                prime[i] = false;
        }
    }
}

ll binpow(ll a, ll b)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1) res = (res * a);
        a = (a * a);
        b >>= 1;
    }
    return res;
}

ll modpow(ll a, ll b,ll x)
{
    ll res = 1;
    while (b > 0)
    {
        if (b & 1) res = (res * a)%x;
        a = (a * a)%x;
        b >>= 1;
    }
    return res;
}

int modInverse(int a, int m)
{
    int m0 = m;
    int y = 0, x = 1;
    if (m == 1)
      return 0;
    while (a > 1)
    {
        // q is quotient
        int q = a / m;
        int t = m;
        // m is remainder now, process same as
        // Euclid's algo
        m = a % m, a = t;
        t = y;
        // Update y and x
        y = x - q * y;
        x = t;
    }
    // Make x positive
    if (x < 0)
       x += m0;
    return x;
}


ll lpf[1000001] = {};
void precompute()
{
  fr(i,2,1000000)
  {
    if(!lpf[i])
    {
      for(ll j=i;j<=1000000;j+=i)
      {
        if(!lpf[j])
        lpf[j]=i;
      }
    }
  }
}

ll a,b;


ll func(ll x)
{
  return min(x,a-2*x)+min(x,b-2*x);
}



ll bs(ll low,ll high,ll target)
{
  while(low+3<high)
  {
    ll mid=(low+high)/2;
    if(func(mid)<=target)
    {
      low=mid;
    }
    else
    {
      high=mid-1;
    }
  }

  frr(o,high,low)
  {
    if(func(o)<=target) return o;
  }

  return -1;//to check for bugs
}

vector<ll> adj[1000010];
ll degree[1000010];

void adj_former(ll n)
{
  rep(o,n-1)
  {
    cc(a,b);
    adj[a].pb(b);
    adj[b].pb(a);
    degree[a]++;
    degree[b]++;
  }
}



ll ts(ll start,ll end)
{
    ll l = start, r = end;

    while(r-l>=4)
    {
      ll l1 = (l*2+r)/3;
      ll l2 = (l+2*r)/3;
      //cout<<l1<<" "<<l2<<endl;
      if(func(l1) > func(l2))
      {
        r = l2;

      }
      else l=l1;
    }


    ll maxo=func(l);
    fr(o,l,r)
    {
      maxo=maxim(maxo,func(o));
    }

    return maxo;
}

ll arr[1000010];
ll brr[1000010];
ll freq[1000010]={0};
ll dp[1000010]={0};
ll mat[1010][1010];
ll maximo[1010][1010];
ll maximo_ultra[1010][1010];
ll partial[1010][1010]={0};

vector<pair<ll,ll> > vec;


ll f(ll n,ll x,ll m)
{
  ll dread=(n/x)*x+x;
  ll num=n/x;
  if(num%2==0) num/=2;
  else dread/=2;
  // num%=m;
  // dread%=m;
  if(num%x==0) num/=x;
  else dread/=x;
  num%=m;
  dread%=m;
  return (num*dread)%m;
}


ll f1(ll n,ll x,ll m)
{
  ll dread=(n/x)*x+x;
  ll num=n/x;
  if(num%2==0) num/=2;
  else dread/=2;
  // num%=m;
  // dread%=m;
  x/=2;
  if(num%x==0) num/=x;
  else dread/=x;
  num%=m;
  dread%=m;
  return (num*dread)%m;
}

vector<ll> cont;


int main()
{
  fast;
  // #ifndef ONLINE_JUDGE
  // // for getting input from input.txt
  // freopen("input.txt", "r", stdin);
  // // for writing output to output.txt
  // freopen("output.txt", "w", stdout);
	// #endif

  cout<<setprecision(10)<<fixed;
  cc(x,n);
  carr(arr,n);
  if(n==0)
  {
    cout<<x<<endl;
  }
  else
  {
    sort(arr,arr+n);
    // print(arr,n);

    ll indexo=-1;
    rep(o,n)
    {
      if(arr[o]==x)
      {
        indexo=o;
        break;
      }
    }

    // debug(indexo);

    if(indexo==-1)
    {
      cout<<x<<endl;
    }
    else
    {
      if(n==1)
      {
        cout<<x-1<<endl;
      }
      else if(indexo==0)
      {
        cout<<x-1<<endl;
      }
      else if(indexo==n-1)
      {
        if(arr[indexo-1]!=x-1)
        {
          cout<<x-1<<endl;
        }
        else
        {
          cout<<x+1<<endl;
        }
      }
      else
      {
        ll left_nearest=-1;
        ll right_nearest=-1;
        ll counter=x-1;
        frr(o,indexo-1,0)
        {
          if(arr[o]!=counter)
          {
            left_nearest=counter;
            break;
          }
          counter--;
        }
        if(left_nearest==-1) left_nearest=counter;

        counter=x+1;
        fr(o,indexo+1,n-1)
        {
          if(arr[o]!=counter)
          {
            right_nearest=counter;
            break;
          }
          counter++;
        }

        if(right_nearest==-1) right_nearest=counter;

        // debug2(left_nearest,right_nearest);

        if(abs(x-right_nearest)<abs(x-left_nearest))
        {
          cout<<right_nearest<<endl;
        }
        else cout<<left_nearest<<endl;
      }
    }
  }


  return 0;
}


Measured memory_bytes: 27096