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*?
The first line of input contains an integer *t* (0 &lt; *t* &lt; 180) — the number of tests. Each of the following *t* lines contains a single integer *a* (0 &lt; *a* &lt; 180) — the angle the robot can make corners at measured in degrees.

import sys
import pprint
import logging
from logging import getLogger

def input(): return sys.stdin.readline().rstrip("\r\n")


logging.basicConfig(format="%(message)s", level=logging.WARNING,)
logger = getLogger(__name__)
logger.setLevel(logging.INFO)


def debug(msg, *args):
    logger.info(f'{msg}={pprint.pformat(args)}')

# 30 MINUTES ATLEAST !!!!

###################################################################################################################

# let's do this by recursion


def printPattern(t, n):
    if t == n + 1:
        return

    for i in range(n - t):
        print(' ', end=' ')

    for i in range(t + 1):
        print(i, end=' ')

    for i in range(t - 1, 0, -1):
        print(i, end=' ')

    print(0)

    printPattern(t + 1, n)

    if t == n:
        return
    for i in range(n - t):
        print(' ', end=' ')

    for i in range(t + 1):
        print(i, end=' ')

    for i in range(t - 1, 0, -1):
        print(i, end=' ')

    print(0)


def single():
    return map(int, input().split())


def t():
    for _ in range(int(input())):
        print('YES' if 360 % (180 - int(input())) == 0 else 'NO')


t()
