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: # for i in range(m):
  # for i in range(int(input())):
  # n,k= map(int, input().split())
  # for _ in range(int(input())):
  # n,k= map(int, input().split())
  # from collections import Counter
  n = int(input())
  if n % 360 == 0:
      print(0)
      exit()
  else:
      var = 1
      while (var * n) % 360 != 0:
          var += 1
      print(var)
  
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"}]