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;
ifstream fi("test2.inp");
long long n, a, k = 3;
long long mode = 0;
float goc = 0;
float process(long long k) {
  float tmp;
  tmp = 180 - (float)360 / k;
  return tmp;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a;
    if (a < 3)
      cout << "NO" << endl;
    else {
      while (goc < a) {
        mode = 0;
        goc = process(k);
        if (goc == a) {
          k = 3;
          mode = 1;
          goc = 0;
          cout << "YES" << endl;
          break;
        } else {
          k++;
        }
      }
      if (mode == 0) {
        k = 3;
        goc = 0;
        cout << "NO" << endl;
      }
    }
  }
  return 0;
}
