package com.Algospot.Weird;

import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;

public class Main {
    static int tk = 0;
    static int divisors[];
    private static Scanner scan;
    static HashSet<Integer> orig;
    static HashSet<Integer> tempset;
    public static void main(String[] args) {
        scan = new Scanner(System.in);
        orig=new HashSet<Integer>();
        tempset=new HashSet<Integer>();
        divisors=new int[50];
        int cases = scan.nextInt();
        while (cases-- > 0) {
            boolean flag=false;
            for(int i=0;i<divisors.length;i++) divisors[i]=0;
            int num = scan.nextInt();
            devide(num);
            if(isexeed(num))
                if(verify(num))
                    flag=true;
            if(flag==true) System.out.println("weird");
            else System.out.println("not weird");
        }
    }

    private static boolean verify(int num) {
        orig.clear();
        for(int i=0;i<tk;i++){
            if(orig.isEmpty()){
                orig.add(divisors[i]);
                continue;
            }
            Iterator<Integer> key=orig.iterator();
            tempset.clear();
            while(key.hasNext()){
                int sumnum=key.next();
                tempset.add(sumnum+divisors[i]);
            }
            if(tempset.contains(num)||orig.contains(num)) return false;
            else orig.addAll(tempset);
        }
        return true;
    }

    static void devide(int n) {
        tk = 0;
        for (int i = 1; i <= (n / 2); i++)
            if (n % i == 0)
                divisors[tk++] = i;
    }
    static boolean isexeed(int num){
     int i=0,sum=0;
     for(i=0;i<tk;i++){
         sum+=divisors[i];
     }
     if(sum>num) return true;
     else return false;
 }

}