#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define fio std::ios::sync_with_stdio(false):cin.tie(0);cout.tie(0)
using namespace std;
int read(){
    int x=0;
    char c=getchar();
    int ret=0;
    while(!isdigit(c))ret|=!(c^'-'),c=getchar();
    while(isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
    if(ret)x=(~x)+1;
    return x;
}
template<typename T>void print(T x){
    if(x<0)putchar('-'),x=(~x)+1;
    if(x>9)print(x/10);
    putchar((x-x/10*10)^48);
    return;
}
template<typename T>void wr1(T x){
    print(x);
    putchar(' ');
    return;
}
template<typename T>void wr2(T x){
    print(x);
    putchar('\n');
    return;
}

int n,ans[32];

int main(){
    for(int tes=read();tes;--tes){
        n=read();
        if(!n||(n&(-n))>2){puts("NO");continue;}
        puts("YES");
        for(int l=-1,r=0;r<=31;++r){
            if(n>>r&1){
                //cout<<l<<' '<<r<<endl;
                if(l!=-1){
                    for(int i=l;i<r-1;++i) ans[i]=-1;
                    ans[r-1]=1;
                }
                l=r;
            }
            else{
                if(l==-1) ans[r]=0;
            }
            if(r==31){
                for(int i=l;i<r;++i) ans[i]=-1;
                ans[r]=1;
            }
        }
        for(int k=0;k<4;++k){
            for(int i=k*8;i<(k+1)*8;++i) printf("%d ",ans[i]);
            puts("");
        }

    }
    return 0;
}