import java.util.Scanner;

public class Main {
public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

    int cases = sc.nextInt();

    while (cases-- > 0) {

        int bucket [] = new int [200];
        int sum = 0, index = 0, j = 0;

        int N = sc.nextInt();

        //divisor를 구하여 bucket 배열에 오름차순으로 저장한다.
        for(int i = 1 ; i < N ; i ++){
            if(N%i == 0)
                bucket[index++] = i;
        }

        //가장 큰 divisor의 index
        --index;

        //divisor의 합
        while(bucket[j] != 0){
            sum += bucket[j++];
        }

        if(sum > N && !condition2(N, 0, index, bucket))
            System.out.println("werid");

        else
            System.out.println("not werid");
    }
}

public static boolean condition2 (int N, int sum, int index, int bucket []){
    if(N < sum)
        return false;

    else if (N == sum)
        return true;

    while(index >= 0){
        sum += bucket[index--];
        if(condition2(N, sum, index, bucket))
            return true;
        else
            sum -= bucket[index+1];
    }
    return false;
}

}