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())
  ls = [2, 2, 2, 3, 3, 5]
  a = []
  for l in ls:
      if X % l == 0:
          a.append(l)
          X /= l
  num = 1
  if len(a) != 0:
      for b in a:
          num *= b
  print(int(360 / num))
  
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"}]