output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X N
      p_1 ... p_N
attempt: import copy
  
  [x, n] = list(map(int, input().split()))
  pList = list(map(int, input().split()))
  dict = {
      1: 0,
      2: 0,
      3: 0,
      4: 0,
      5: 0,
      6: 0,
      7: 0,
      8: 0,
      9: 0,
      10: 0,
      11: 0,
      12: 0,
      13: 0,
      14: 0,
      15: 0,
      16: 0,
      17: 0,
      18: 0,
      19: 0,
      20: 0,
      21: 0,
      22: 0,
      23: 0,
      24: 0,
      25: 0,
      26: 0,
      27: 0,
      28: 0,
      29: 0,
      30: 0,
      31: 0,
      32: 0,
      33: 0,
      34: 0,
      35: 0,
      36: 0,
      37: 0,
      38: 0,
      39: 0,
      40: 0,
      41: 0,
      42: 0,
      43: 0,
      44: 0,
      45: 0,
      46: 0,
      47: 0,
      48: 0,
      49: 0,
      50: 0,
      51: 0,
      52: 0,
      53: 0,
      54: 0,
      55: 0,
      56: 0,
      57: 0,
      58: 0,
      59: 0,
      60: 0,
      61: 0,
      62: 0,
      63: 0,
      64: 0,
      65: 0,
      66: 0,
      67: 0,
      68: 0,
      69: 0,
      70: 0,
      71: 0,
      72: 0,
      73: 0,
      74: 0,
      75: 0,
      76: 0,
      77: 0,
      78: 0,
      79: 0,
      80: 0,
      81: 0,
      82: 0,
      83: 0,
      84: 0,
      85: 0,
      86: 0,
      87: 0,
      88: 0,
      89: 0,
      90: 0,
      91: 0,
      92: 0,
      93: 0,
      94: 0,
      95: 0,
      96: 0,
      97: 0,
      98: 0,
      99: 0,
      100: 0,
  }
  for i in pList:
      dict[i] = 1
  goUp = True
  goDown = True
  run = True
  upTar = copy.copy(x)
  lowTar = copy.copy(x)
  theAns = copy.copy(x)
  while run:
      if dict[lowTar] == 0:
          theAns = lowTar
          break
      if dict[upTar] == 0:
          theAns = upTar
          break
      if goUp:
          upTar += 1
      if goDown:
          lowTar -= 1
      if upTar == 100:
          goUp = False
      if lowTar:
          goDown = False
  print(theAns)
  
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."}]