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 sys
  
  
  def main(source, step, dest):
  
      if abs(source) > (dest):
          return sys.maxsize
  
      if source == dest:
          return step
      pos = main(source + step + 1, step + 1, dest)
  
      neg = main(source - step - 1, step + 1, dest)
  
      return min(pos, neg)
  
  
  dest = 11
  print("No. of steps required", " to reach ", dest, " is ", main(0, 0, dest))
  
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"}]