AtCoder Grand Contest 046
翻译中…
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.
翻译中…
样例
Input #1
90
Output #1
4
Takahashi's path is a square.
Input #2
1
Output #2
360
题目信息
题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。