import math
from itertools import combinations

T = int(raw_input().strip())

for t in xrange(T):

    N = int(raw_input().strip())

    ### Find divisors
    divisors = []
    divisors.append(1)

    sqrtN = int(math.sqrt(N))
    for i in xrange(2, sqrtN):
        if N % i == 0:
            divisors.append(i)
            if i * i != N:
                divisors.append(N/i)

    ### Get sum of divisors
    sumDiv = sum(divisors)

    weird = False
    if sumDiv > N:
        weird = True
        i = 1

        ### For each subset, calculate the sum
        while i < len(divisors):
            for c in combinations(divisors, i):
                if sum(c) == N:
                    weird = False
                    i = len(divisors)
                    break
            i += 1

    if weird:
        print 'weird'
    else:
        print 'not weird'