#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double

using namespace std;

mt19937 rng(0);

vector<pair<pair<int,int>,pair<int,int>>> ans[7];
int main()
{
	for(int n=1;n<=4;n++){
		int cn=0;
		while(1){
			cn++;
			map<int,int> want;
			want[0]=1;
			vector<pair<pair<int,int>,pair<int,int>>> my;
			bool done=0;
			for(int y=n;y>-100;y--){
				if(y<=0){
					map<int,int> w2;
					for(auto p:want)if(p.s>1)w2[p.f]=p.s-1;
					want=w2;
				}
				if(sz(want)==0){
					done=1;
					break;
				}
				bool bad=0;
				for(auto p:want){
					if(p.s>2){
						bad=1;
					}
				}
				if(bad)break;
				map<int,int> w2;
				for(auto p:want){
					for(int i=0;i<p.s;i++){
						if(rng()%2){
							w2[p.f-1]++;
							my.pb({{p.f-1,y-1},{p.f,y-1}});
						}
						else{
							w2[p.f+1]++;
							my.pb({{p.f+1,y-1},{p.f,y-1}});
						}
						w2[p.f]++;
					}
				}
				want=w2;
			}
			if(done){
				reverse(all(my));
				ans[n]=my;
				break;
			}
		}
	}
	int t;
	cin >> t;
	while(t--){
		int n;
		cin >> n;
		if(sz(ans[n])==0){
			printf("-1\n");
		}
		else{
			printf("%i\n",sz(ans[n]));
			for(auto p:ans[n]){
				printf("%i %i %i %i %i %i\n",p.f.f,p.f.s,p.s.f,p.s.s,p.s.f,p.s.s+1);
			}
		}
	}
	return 0;
}