#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e5+5,M=N*20+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(263082);
int n,m;
vector<tuple<int,int,int> > ans;vector<int> tot;
void con(int x,int z,int y){if(x<z&&z<y) ans.emplace_back(x,z,y);}
void solve(int l,int r){
	if(r-l<=3) return;
	int BB=sqrt((r-l)*0.9);
	for(int i=l+BB-1;i<=r;i+=BB){
		for(int j=i-1;j>i-BB;j--) con(j,j+1,i);
		for(int j=i+1;j<i+BB&&j<=n;j++) con(i,j-1,j);
		for(int j=i-BB;j>=l;j-=BB) con(j,j==i-BB?j+1:j+BB,i);
	}
	int i;
	for(i=l+BB-1;i<=r;i+=BB) solve(i-BB+1,i);
	solve(i-BB+1,r);
}
void qry(int x,int y,int l,int r){
	if(r-l<=3){
		for(int i=x;i<=y;i++) tot.emplace_back(i);
		return;
	}
	int BB=sqrt((r-l)*0.9);
	int X=x,Y=y;
	while(X<=r&&(X-l)%BB!=BB-1) X++;
	while(Y>=l&&(Y-l)%BB!=BB-1) Y--;
	if(X>Y) return qry(x,y,Y+1,X-1);
	tot={x,X,Y,y};
}
void Solve(){
	int i,j;cin>>n;
	solve(0,n);
	cout<<ans.size()<<'\n';
	for(auto i:ans){
		int x,y,z;tie(x,y,z)=i;
		cout<<x<<' '<<y<<' '<<z<<'\n';
	} fflush(stdout);
	int q;cin>>q;//cout<<"ZJAKIOI";
	ans.clear();
	while(q--){
		int x,y;cin>>x>>y;
		tot.clear();qry(x,y,0,n);
		sort(tot.begin(),tot.end());tot.erase(unique(tot.begin(),tot.end()),tot.end());
		for(int i:tot) cout<<i<<' ';cout<<'\n';fflush(stdout);
	}
}
int main(){
	// freopen("1.in","r",stdin);
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}