output_description: Print Q lines. The j-th line (1 \leq j \leq Q) should contain the minimum
  number of days that Tak needs to travel from the a_j-th hotel to the b_j-th
  hotel.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N
      x_1 x_2 ... x_N
      L
      Q
      a_1 b_1
      a_2 b_2
      :
      a_Q b_Q
attempt: n, *x = map(int, open(0).read().split())
  d = [0] + [10**9] * ~-n
  l = x[n]
  i = t = 0
  for j, y in enumerate(x[1:n], 1):
      t = y - x[i]
      while t > l:
          i += 1
          t = y - x[i]
      print(i, j, t)
      d[j] = d[i] + 1
  for a, b in zip(x[n + 2 :: 2], x[n + 3 :: 2]):
      print(abs(d[a - 1] - d[b - 1]) or 1)
  
problem_description: Statement
  
  N hotels are located on a straight line. The coordinate of the i-th hotel (1
  \leq i \leq N) is x_i.
  
  Tak the traveler has the following two personal principles:
  
    * He never travels a distance of more than L in a single day.
    * He never sleeps in the open. That is, he must stay at a hotel at the end of a day.
  
  You are given Q queries. The j-th (1 \leq j \leq Q) query is described by two
  distinct integers a_j and b_j. For each query, find the minimum number of days
  that Tak needs to travel from the a_j-th hotel to the b_j-th hotel following
  his principles. It is guaranteed that he can always travel from the a_j-th
  hotel to the b_j-th hotel, in any given input.
samples: [{"input": "9\n    1 3 6 13 15 18 19 29 31\n    10\n    4\n    1 8\n    7 3\n    6 7\n    8 5", "output": "4\n    2\n    1\n    2\n    \n\nFor the 1-st query, he can travel from the 1-st hotel to the 8-th hotel in 4\ndays, as follows:\n\n  * Day 1: Travel from the 1-st hotel to the 2-nd hotel. The distance traveled is 2.\n  * Day 2: Travel from the 2-nd hotel to the 4-th hotel. The distance traveled is 10.\n  * Day 3: Travel from the 4-th hotel to the 7-th hotel. The distance traveled is 6.\n  * Day 4: Travel from the 7-th hotel to the 8-th hotel. The distance traveled is 10."}]