import java.util.*; 

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int cases = sc.nextInt();
        if(cases > 200){
            return;
        }
        while(cases-- > 0) {
            Boolean isWeird = false;
            int chkNumber = 0;
            ArrayList<Integer> list;

            String num = sc.next();
            chkNumber = Integer.parseInt(num);

            if(chkNumber >= 500000 || chkNumber <1){
                return;
            }

            list = getDivisor(chkNumber);

            int listTotalSum = 0;
            for (int i = 0; i < list.size(); i++) {
                listTotalSum += list.get(i);
            }

            if(listTotalSum <= chkNumber){
                isWeird =false;
            }else{
                int count = list.size();
                int pow = (int)Math.pow(2, (double)count);

                for (int i = 0; i < pow; i++) {
                    int subsetSum = 0;

                    for (int j = 0; j < count; j++) {
                        {
                            if((i&(1<<j)) > 0){
                                subsetSum += list.get(j);
                                if(subsetSum >= chkNumber){
                                    break;
                                }
                            }
                        }
                    }
                    if(subsetSum == chkNumber){
                        isWeird = false;
                        break;
                    }else{
                        isWeird = true;
                    }
                }
            }
            if(isWeird){
                System.out.println("weird");    
            }else{
                System.out.println("not weird");
            }
        }

    }
    // 약수 반환 메서드
    private static ArrayList<Integer> getDivisor(int num) {
        ArrayList<Integer> divisorList = new ArrayList<Integer>();

        for(int i = num-1; i>0; i--) {
            if(num%i==0)
            {
                divisorList.add(i);        //나누어떨어지면 약수 등록(내림차순등록)
            }
        }
        return divisorList;
    }
}