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: import math
  
  delta=int(input())
  theta=90+delta
  dist= 1
  x,y=0,1
  count=1
  while(round(dist)!=0):
      rad= theta*math.pi/180
      vx= math.cos(rad)
      vy=math.sin(rad)
      x+=vx
      y+=vy
      dist= math.sqrt(x*x+y*y)
      count+=1
      theta=(theta+delta)%360
  print(count)
  
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"}]