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.

import java.util.*;
import java.math.*;
import java.io.*;

/**
 *
 * @author magzhan
 */
public class Main {
    
    
    public static int gcd(int x, int y) {
        BigInteger bx = BigInteger.valueOf(x);
        BigInteger by = BigInteger.valueOf(y);
        BigInteger bgcd = bx.gcd(by);
        return bgcd.intValue();
    }
    
    public static int meth(String s) {
        
        int x = 0;
        
        if (s.subSequence(0, 2).equals("++")) {
            ++x;
        }
        if (s.subSequence(0, 2).equals("--")) {
            --x;
        }
        if (s.subSequence(1, 3).equals("++")) {
            x++;
        }
        if (s.subSequence(1, 3).equals("--")) {
            x--;
        }
        return x;
    }

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        try {
        
            Scanner in = new Scanner(System.in);
           
            int t = in.nextInt();
            int[] a = new int[t];
            for (int i = 0; i < t; i++) {
               a[i] = in.nextInt();
            }
           
            for (int i = 0; i < t; i++) {
                if (360 % (180 - a[i]) == 0) {
                   System.out.println("YES");
                } else {
                   System.out.println("NO");
                }    
            }
            
            
        } catch(Exception ex) {
        
            System.out.println(ex.toString());
        }
    }
    
}
