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>
const int32_t M = 1e9 + 7;
const int32_t mod = 998244353;
using namespace std;
unsigned long long int fib(unsigned long long int n) {
  double phi = (1 + sqrt(5)) / 2;
  unsigned long long int ans = round(pow(phi, n) / sqrt(5));
  return ans;
}
long long int nCr(long long int n, long long int r) {
  long long int res;
  if (r > (n - r)) r = n - r;
  for (long long int i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
unsigned long long int fact(int n) {
  return (n == 1 || n == 0) ? 1 : n * fact(n - 1);
}
long long int gcd(long long int a, long long int b) {
  return b ? gcd(b, a % b) : a;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    if (360 % (180 - n) == 0)
      cout << "YES" << '\n';
    else
      cout << "NO" << '\n';
  }
  return 0;
}
