#include<bits/stdc++.h>
#define int long long
#define double long double
#define N 1000005
using namespace std;
int T,n,m;
struct node{
    int x,y;
    double d;
    bool operator<(const node&t)const{
        return d<t.d;
    }
};
vector<node> t;
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int T;
    cin>>T;
    for(int i=1000;i<=2000;i++){
        for(int j=0;j<=1000;j++){
            double x=sqrt(i)+sqrt(j);
            t.push_back({i,j,modf(x,&x)});
        }
    }
    sort(t.begin(),t.end());
    // cout<<t.size()<<"\n";
    while(T--){
        double x,d,dd;
        cin>>x,d=modf(x,&dd);
        // cout<<fixed<<setprecision(12)<<d<<endl;
        int l=0,r=1002000*d;
        while(l<r){
            double tmp=d-t[l].d-t[r].d;
            if(fabs(tmp)<9.2e-11){
                double r=x-sqrt(t[l].x)-sqrt(t[l].y)-sqrt(t[r].x)-sqrt(t[r].y);
                cout<<5<<" "<<t[l].x<<" "<<t[l].y<<" "<<t[r].x<<" "<<t[r].y<<" "<<(int)(r*r+0.5)<<"\n";
                goto ok;
            }
            if(tmp<0) r--;
            else l++;
        }
        goto FAIL;ok:;continue;FAIL:;
        l=1002000*d,r=1002000;
        while(l<r){
            double tmp=d+1-t[l].d-t[r].d;
            if(fabs(tmp)<9.2e-11){
                double r=x-sqrt(t[l].x)-sqrt(t[l].y)-sqrt(t[r].x)-sqrt(t[r].y);
                cout<<5<<" "<<t[l].x<<" "<<t[l].y<<" "<<t[r].x<<" "<<t[r].y<<" "<<(int)(r*r+0.5)<<"\n";
                break;
            }
            if(tmp<0) r--;
            else l++;
        }
    }
}