Problem:
Score : 200 points

Problem 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.

Constraints

1 \leq X \leq 179

X is an integer.

Input

Input is given from Standard Input in the following format:

X

Output

Print the number of times Takahashi will do the action before he is at the starting position again.

Sample Input 1

90

Sample Output 1

4

Takahashi's path is a square.

Sample Input 2

1

Sample Output 2

360

Solution in Ruby (2.7.1) (judge verdict: Accepted)

class Strider
  def solve(x)
    i = 1
    while true
      if 360 * i % x == 0
        return 360 * i / x
      else
        i += 1
      end
    end
  end
  
  def run
    x = gets.chomp.to_i
    puts solve(x)
  end
end

if $0 == __FILE__
  Strider.new.run
end