output_description: Print the minimum number of spells required.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      a_1 a_2 ... a_N
attempt: T = int(input())
  a = []
  for i in range(T):
      a.append(list(map(int, input().split())))
  for r in a:
      s, b, c, d = r[0], r[1], r[2], r[3]
      mod_list = []
      if (s < b) or (b > d):
          print("No")
          break
      if c > b:
          print("Yes")
          break
      while True:
          s = s % b
          if s > c:
              print("No")
              break
          s += d
          if s in mod_list:
              print("Yes")
              break
          mod_list.append(s)
  
problem_description: Statement
  
  Takahashi lives in another world. There are slimes (creatures) of 10000 colors
  in this world. Let us call these colors Color 1, 2, ..., 10000.
  
  Takahashi has N slimes, and they are standing in a row from left to right. The
  color of the i-th slime from the left is a_i. If two slimes of the same color
  are adjacent, they will start to combine themselves. Because Takahashi likes
  smaller slimes, he has decided to change the colors of some of the slimes with
  his magic.
  
  Takahashi can change the color of one slime to any of the 10000 colors by one
  spell. How many spells are required so that no slimes will start to combine
  themselves?
samples: [{"input": "5\n    1 1 2 2 2", "output": "2\n    \n\nFor example, if we change the color of the second slime from the left to 4,\nand the color of the fourth slime to 5, the colors of the slimes will be 1, 4,\n2, 5, 2, which satisfy the condition.\n\n* * *"}, {"input": "3\n    1 2 1", "output": "0\n    \n\nAlthough the colors of the first and third slimes are the same, they are not\nadjacent, so no spell is required.\n\n* * *"}, {"input": "5\n    1 1 1 1 1", "output": "2\n    \n\nFor example, if we change the colors of the second and fourth slimes from the\nleft to 2, the colors of the slimes will be 1, 2, 1, 2, 1, which satisfy the\ncondition.\n\n* * *"}, {"input": "14\n    1 2 2 3 3 3 4 4 4 4 1 2 3 4", "output": "4"}]