output_description: Print the index of the place where the palace should be built.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      T A
      H_1 H_2 ... H_N
attempt: n = int(input())
  t, a = map(int, input().split())
  places = map(int, [input() for _ in range(n)]
  
  k = places.map(lambda x: abs(a - t - (H * 0.006)) // が最小となるindex
      
  
  target = enumerate(k)        
  ans = (0, 99999)
  
  for i in target:
      if i[1] < ans[1]:
          ans = i
  
  print(i[0])
problem_description: Statement
  
  A country decides to build a palace.
  
  In this country, the average temperature of a point at an elevation of x
  meters is T-x \times 0.006 degrees Celsius.
  
  There are N places proposed for the place. The elevation of Place i is H_i
  meters.
  
  Among them, Princess Joisino orders you to select the place whose average
  temperature is the closest to A degrees Celsius, and build the palace there.
  
  Print the index of the place where the palace should be built.
  
  It is guaranteed that the solution is unique.
samples: [{"input": "2\n    12 5\n    1000 2000", "output": "1\n    \n\n  * The average temperature of Place 1 is 12-1000 \\times 0.006=6 degrees Celsius.\n  * The average temperature of Place 2 is 12-2000 \\times 0.006=0 degrees Celsius.\n\nThus, the palace should be built at Place 1.\n\n* * *"}, {"input": "3\n    21 -11\n    81234 94124 52141", "output": "3"}]