#include <bits/stdc++.h>
using namespace std;

#define PI acos(-1)
int N;

double get_angle(int sz) {
    int dot = (-sz * 2) + (sz - 1);
    int len = (sz) + (sz) * (sz);
    return acos(dot *1.0 / len*1.0);
}

void solve(vector<vector<double> >& pts, int cur) {
    if (cur == N+2) return;
    double theta = get_angle(cur - 1) - PI / 2;
    for (int i = 0; i < pts.size(); i++) {
        for (int k = 0; k < pts[i].size(); k++) {
            pts[i][k] *= cos(theta);
        }
        pts[i].push_back(-sin(theta));
    }
    vector<double> new_pt;
    for (int i = 2; i < cur; i++) new_pt.push_back(0);
    new_pt.push_back(1);
    pts.push_back(new_pt);

    solve(pts, cur + 1);
}

int main() {

    cout << fixed << setprecision(9);

    int T; cin >> T;
    while (T) {
        cin >> N;
        if (N == 1) {
            cout << 1 << "\n" << -1 << "\n";
        } else {
            vector<vector<double> > pts;
            vector<double> p1, p2;
            p1.push_back(1);
            p2.push_back(-1);
            pts.push_back(p1); pts.push_back(p2);
            solve(pts, 3);

            for (int i = 0; i < pts.size(); i++) {
                for (int k = 0; k < pts[i].size(); k++) {
                    cout << pts[i][k] << " ";
                } cout << "\n";
            }
        }
        cout << "\n";
        T--;
    }

    return 0;
}