#agc046a. [agc046_a]Takahashikun, The Strider
[agc046_a]Takahashikun, The Strider
Problem Statement
Takahashi is standing on a two-dimensional plane, facing north. Find the minimum positive integer such that Takahashi will be at the starting position again after he does the following action times:
- Go one meter in the direction he is facing. Then, turn degrees counter-clockwise.
Constraints
- is an integer.
Input
Input is given from Standard Input in the following format:
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