Codeforces 270A

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

3306090

output

NOYESYES

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.

题意：问每个角度数为n°，能否构成一个多边形？

多边形外角和为360度，则多边形边数k=360/(180-n)。

代码如下：

#include<iostream>#include<algorithm>using namespace std;int main(){int t;while (cin >> t){while (t--){int n;cin >> n;if (360 % (180 - n) == 0)//多边形外角和为360度cout << "YES" << endl;elsecout << "NO" << endl;}}return 0;}