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 <image>.

In the second test case, the fence is a regular triangle, and in the last test case — a square.
#include <bits/stdc++.h>
using namespace std;
void swap(long long int *a, long long int *b) {
  long long temp = *a;
  *a = *b;
  *b = temp;
}
unsigned long long mod_pow(unsigned long long b, unsigned long long p,
                           unsigned long long mod) {
  unsigned long long s = 1;
  while (p) {
    if (p & 1) s = (s * b) % mod;
    b = (b * b) % mod;
    p >>= 1;
  }
  return s;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    scanf("%lld", &n);
    if (360 % (180 - n) == 0)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
