output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X N
      p_1 ... p_N
attempt: xn = input().split()
  X = int(xn[0])
  N = int(xn[1])
  A = [int(x) for x in input().split()]
  li = [x for x in range(102)]
  li2 = list(x for x in li if x not in A)
  d_tmp = 1200
  ans_tmp = -1
  for i in li2:
      d = abs(X - i)
      if d < d_tmp:
          d_tmp = d
          ans_tmp = i
  print(ans_tmp)
  
problem_description: Statement
  
  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.
samples: [{"input": "6 5\n    4 7 10 6 5", "output": "8\n    \n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the one\nnearest to 6 is 8.\n\n* * *"}, {"input": "10 5\n    4 7 10 6 5", "output": "9\n    \n\nAmong the integers not contained in the sequence 4, 7, 10, 6, 5, the ones\nnearest to 10 are 9 and 11. We should print the smaller one, 9.\n\n* * *"}, {"input": "100 0", "output": "100\n    \n\nWhen N = 0, the second line in the input will be empty. Also, as seen here, X\nitself can be the answer."}]