题目描述
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.
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.
Constraints
- $1 \leq X \leq 179$
- X is an integer.
Sample Input 1
90
Sample Output 1
4
Takahashi's path is a square.
Sample Input 2
1
Sample Output 2
360
输入格式
见题面 Input 部分
输出格式
见题面 Output 部分
样例输入
90
样例输出
4