output_description: Print `YES` if it is possible to fill the squares under the condition; print
  `NO` otherwise.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B C D
attempt: N, a, b, c, d = map(int, input().split())
  n = N - 1
  ans = "No"
  for i in range(n + 1):
      m1 = i * d - (n - i) * c
      m2 = -1 * (n - i) * d + i * c
      if m1 <= m2:
          if a + m1 <= b and b <= a + m2:
              ans = "Yes"
              # print(m1,m2)
              break
      else:
          if a + m2 <= b and b <= a + m1:
              ans = "Yes"
              # print(m1,m2)
              break
  print(ans)
  
problem_description: Statement
  
  There are N squares in a row. The leftmost square contains the integer A, and
  the rightmost contains the integer B. The other squares are empty.
  
  Aohashi would like to fill the empty squares with integers so that the
  following condition is satisfied:
  
    * For any two adjacent squares, the (absolute) difference of the two integers in those squares is between C and D (inclusive).
  
  As long as the condition is satisfied, it is allowed to use arbitrarily large
  or small integers to fill the squares. Determine whether it is possible to
  fill the squares under the condition.
samples: [{"input": "5 1 5 2 4", "output": "YES\n    \n\nFor example, fill the squares with the following integers: 1, -1, 3, 7, 5,\nfrom left to right.\n\n* * *"}, {"input": "4 7 6 4 5", "output": "NO\n    \n\n* * *"}, {"input": "48792 105960835 681218449 90629745 90632170", "output": "NO\n    \n\n* * *"}, {"input": "491995 412925347 825318103 59999126 59999339", "output": "YES"}]