跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2559. Fancy Fence

    ID: 2565 传统题 2000ms 256MiB 尝试: 0 已通过: 0 难度: (无) 上传者: 标签>待分类整理状态难度待定难度共享题库Codeforces英文题面题目来源题面语言

Fancy Fence

题目描述

A. Fancy Fence
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Emuskald needs a fence around his farm, but he is too lazy to build it himself. So he purchased a fence-building robot.

He wants the fence to be a regular polygon. The robot builds the fence along a single path, but it can only make fence corners at a single angle a.

Will the robot be able to build the fence Emuskald wants? In other words, is there a regular polygon which angles are equal to a?

Input

The first line of input contains an integer t (0<t<180) − the number of tests. Each of the following t lines contains a single integer a (0<a<180) − the angle the robot can make corners at measured in degrees.

Output

For each test, output on a single line "YES" (without quotes), if the robot can build a fence Emuskald wants, and "NO" (without quotes), if it is impossible.

Examples
Input
3
30
60
90
Output
NO
YES
YES
Note

In the first test case, it is impossible to build the fence, since there is no regular polygon with angle .

In the second test case, the fence is a regular triangle, and in the last test case − a square.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 2205 题。保留原作者与原赛事署名。