output_description: Print the number of times Takahashi will do the action before he is at the
  starting position again.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X
attempt: x = int(input())
  if 360 % x == 0:
      print(int(360 / x))  # 2 * 2 * 2 * 3 * 3 * 5
  else:
      count_2 = 0
      count_3 = 0
      count_5 = 0
      while x % 2 == 0:
          count_2 += 1
          x /= 2
          if count_2 == 3:
              break
      while x % 3 == 0:
          count_3 += 1
          x /= 3
          if count_3 == 2:
              break
      while x % 5 == 0:
          count_5 += 1
          x /= 5
          if count_5 == 1:
              break
      print((2 ** (3 - count_2)) * (3 ** (2 - count_3)) * (5 ** (1 - count_5)))
  
problem_description: Statement
  
  Takahashi is standing on a two-dimensional plane, facing north. Find the
  minimum positive integer K such that Takahashi will be at the starting
  position again after he does the following action K times:
  
    * Go one meter in the direction he is facing. Then, turn X degrees counter-clockwise.
samples: [{"input": "90", "output": "4\n    \n\nTakahashi's path is a square.\n\n* * *"}, {"input": "1", "output": "360"}]