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: import numpy as np
  
  
  def find_nearest(array, value):
      min_value = np.abs(max(array))
      min_idx = 0
      j = 0
  
      for i in array:
          j += 1
          if min_value > np.abs(value - i):
              min_value = np.abs(value - i)
              min_idx = j
      return min_idx
  
  
  input_N = input()
  input_two = input().split()
  input_three = input().split()
  
  N = int(input_N)
  T = int(input_two[0])
  A = float(input_two[1])
  
  H_f = [float(s) for s in input_three]
  j = 0
  degree_list = list(range(j))
  for i in H_f:
      degree_list.append(T - i * 0.006)
  
  print(find_nearest(degree_list, A))
  
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"}]