#include<iostream>
#include<cmath>
using namespace std;

int compare(const void* a,const void* b) {
    int* tempa = (int*)a;
    int* tempb = (int*)b;
    return  *tempa - *tempb ;
}

void is(int parr[], int pidx, int fidx, int key,bool *pbool) {
    if (key == 0) {
        *pbool = true;
    }
    else if (key < 0)return;
    else if (fidx > pidx) {
        return;
    }
    else {
        is(parr, pidx, fidx + 1, key, pbool);
        is(parr, pidx, fidx + 1, key - parr[fidx], pbool);
    }
}

int main() {
    int k;
    cin >> k;
    while (k--) {
        int n;
        bool greater = false;
        int temp=0;
        cin >> n;
        double sqr = sqrt(n);
        int *arr = new int[((int)sqr * 2)+1];
        int arrtemp = 0;
        int sum = 1;
        arr[arrtemp++] = 1;
        if (((int)sqr*(int)sqr) == n) {
            sum += sqr;
        }
        for (int i = 2;i < sqr;i++) {
            if (n%i == 0) {
                arr[arrtemp++] = i;
                arr[arrtemp++] = (n / i);
                sum += i;
                sum += (n / i);
            }
        }
        if (sum >= n) {
            greater = true;
        }
        if (!greater)
            cout << "not weild" << endl;
        else
        {
            qsort(arr, arrtemp, sizeof(int),compare);
            if ((sum - n) > n) {
                temp = n;
            }
            else {
                temp = sum - n;
            }
            int idx=0;
            for (idx;arr[idx] < temp&&idx <= arrtemp;idx++);
            bool check = false;
                is(arr, idx, 0, temp,&check);
            if (check)
                cout << "not weild" << endl;
            else
                cout << "weild" << endl;
        }
    }
    return 0;
}