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.
"""
Title: A. Fancy Fence

Time Limit: time limit per test2 seconds
Memory Limit: memory limit per test256 megabytes

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_?



Test Cases:

    3  
    30  
    60  
    90  
    



    NO  
    YES  
    YES  
    


====================================

"""

import sys

class Scanner:

    def __init__(self):
        self.current_tokens = []

    def remaining_tokens(self):
        return len(self.current_tokens)

    def nextline(self):
        assert self.remaining_tokens() == 0, "Reading next line with remaining tokens"
        return input()

    def nexttokens(self):
        return self.nextline().split()
    
    def nexttoken(self):
        if len(self.current_tokens) == 0:
            self.current_tokens = self.nexttokens()
        assert self.remaining_tokens() > 0, "Not enough tokens to parse."
        return self.current_tokens.pop(0)

    def nextints(self, n=-1):
        if n == -1:
            return list(map(int, self.nexttokens()))
        else:
            return [self.nextint() for i in range(n)]
    
    def nextint(self):
        return int(self.nexttoken())

def quit():
    sys.exit(0)

stdin = Scanner()
nextint = stdin.nextint
nextints = stdin.nextints
nextline = stdin.nextline

N = nextint()
EPS = 1e-10

for _ in range(N):
    a = nextint()
    x = (-2 / (a / 180 - 1))
    if int(x - EPS) != int(x + EPS):
        print("YES")
    else:
        print('NO')

