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

#define rep(i,a,b) for(int i=(a),i##end=(b);i<=i##end;++i)
#define per(i,a,b) for(int i=(a),i##end=(b);i>=i##end;--i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template<typename T>void chkmax(T&x,const T&y){if(x<y)x=y;}
template<typename T>void chkmin(T&x,const T&y){if(y<x)x=y;}

#define pb push_back
#define ALL(x) (x).begin(),(x).end()
#define mem(x) memset((x),0,sizeof(x))

typedef double db;
typedef long long ll;
typedef vector<int>vi;
typedef pair<int,int>pii;

typedef unsigned u32;
typedef unsigned uint;
typedef unsigned long long u64;

namespace orzjk{
  const int SZ=1e6;
  char buf[SZ],*p1=buf,*p2=buf;
  char nc(){
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,SZ,stdin),p1==p2)?EOF:*p1++;
  }
  char fub[SZ],*p3=fub,*p4=fub+SZ;
  void pc(char c){
    p3==p4&&(fwrite(fub,1,SZ,stdout),p3=fub);
    *p3++=c;
  }
  void flush(){
    fwrite(fub,1,p3-fub,stdout),p3=fub;
  }
}
using orzjk::nc;
using orzjk::pc;

//#define nc getchar
//#define pc putchar

int read(){
  int x=0,f=1;char c=nc();
  while(c<48)c=='-'&&(f=-1),c=nc();
  while(c>47)x=x*10+(c^48),c=nc();
  return x*f;
}
template<class T>void write(T x){
  static char st[41];
  if(!x)return pc(48),void();
  char*p=st;
  if(x<0)x=-x,pc('-');
  for(;x;x/=10)*p++=x%10|48;
  do{
    pc(*--p);
  }while(p!=st);
}

//const int P=1e9+7;
const int P=998244353;
int qp(int a,int k){
  int res=1;for(;k;k>>=1,a=1ll*a*a%P)if(k&1)res=1ll*res*a%P;return res;
}

// https://uoj.ac/submission/544079

// Skyqwq

#define pb push_back
#define fi first
#define se second
#define mp make_pair

typedef long long LL;
typedef pair<int, int> PII;

template <typename T> bool chkMax(T &x, T y) { return (y > x) ? x = y, 1 : 0; }
template <typename T> bool chkMin(T &x, T y) { return (y < x) ? x = y, 1 : 0; }

template <typename T> void inline read(T &x) {
    int f = 1; x = 0; char s = getchar();
    while (s < '0' || s > '9') { if (s == '-') f = -1; s = getchar(); }
    while (s <= '9' && s >= '0') x = x * 10 + (s ^ 48), s = getchar();
    x *= f;
}

const int N = 1<<16|5, S = 4;

int n, k, m, f[S][N];

PII e[1000000];

bitset<N>g[N];

struct sto{
  int a,b,c;
};
vector<sto>out;

void inline add(int i, int j, int mid) {
	if (i + 1 >= j || g[i][j] || i < 0 || j >= n) return;
	g[i][j] = 1;
	e[++m] = mp(i, j);
	
	out.pb({i,mid,j});
}

struct W{
	int m, u, v, P, Q, Z;
} G[S][N];

void inline work() {
	memset(f, 0x3f, sizeof f);
	for (int i = 0; i <= k; i++) f[i][0] = f[i][1] = 0;
	for (int i = 1; i <= n; i++)
		f[1][i] = 1ll * (i - 1) * (i - 2) / 2;
	for (int i = 2; i <= n; i++) {
		if (i <= 3) {
			f[2][i] = 0;
			continue;
		}
		int A = (i - 1) / 2;
		f[2][i] = f[2][A] + f[2][i - A - 1] + i - 3;
	}
	for (int j = 3; j <= k; j++) {
		for (int i = 1; i <= n; i++) {
			if (i <= j + 1) {
				f[j][i] = 0;
				continue;
			}
			f[j][i] = f[j - 1][i];
			int le = 3, re = i;
			if (i >= 100) {
				int ot = 50;
				if (j >= 10) ot = 200;
				if (j == 14) ot = 400;
				if (j == 15) ot = 500;
				chkMin(re, G[j][i - 1].m + ot);
				chkMax(le, G[j][i - 1].m - ot);
			}
			for (int m = le; m <= re; m++) {
				int L = max((i - (m - 1)) / m, 0), R = min((i - (m - 1)) / 2, n);
				int lim = j <= 5 ? 5 : 1;
				chkMax(L, G[j][i - 1].u - lim);
				chkMin(R, G[j][i - 1].u + lim);
				
				for (int u = L; u <= R; u++) {
					for (int v = u; v <= u + 1; v++) {
						int le = (i - (m - 1) - u - v);
						if (le < 0) continue;
						int c = f[j][u] + f[j][v] + max(u - 1, 0) + max(v - 1, 0);
						c += f[j - 2][m - 1] + m - 2;
						
						int P = le / (m - 2), Q = le % (m - 2);
						int Z = m - 2 - Q;
						c += f[j][P] * Z + Z * (max(2 * P - 2, 0));
						c += f[j][P + 1] * Q + Q * (2 * P);
						if (chkMin(f[j][i], c))
						 	G[j][i] = (W) { m, u, v, P, Q, Z };	
					}
					
				}
			}
		}
	}
}

vector<int> ed[N];

int F[N];

void inline chk() {
	for (int i = 1; i <= m; i++)
		ed[e[i].fi].pb(e[i].se);
	for (int i = 0; i + 1 < n; i++) ed[i].pb(i + 1);
	for (int i = 0; i < n; i++) {
		memset(F, 0x3f, sizeof F);
		F[i] = 0;
		for (int u = i; u < n; u++) {
			if (F[u] > k) cout << i << " " << u << "???" << F[u] << endl;
			assert(F[u] <= k);
			for (int v: ed[u]) chkMin(F[v], F[u] + 1);
		}
	}
}

int tim;
vi anc[N];
vi twi[N];

void inline link(int k, vector<int> a) {
	int n = a.size();
	if (n <= k + 1) return;
	
	if (k == 1) {
		for (int i = 0; i < n; i++)
			for (int j = i + 2; j < n; j++)
				add(a[i], a[j], a[j-1]);
		return;
	}
	if (k == 2) {
	  assert(0);
//		int mid = n >> 1;
//		vector<int> A, B;
//		per(i,mid)
//		for (int i = 0; i < mid; i++) {
//			add(a[i], a[mid]);
//			A.pb(a[i]);
//		}
//		for (int i = mid + 1; i < n; i++)
//			add(a[mid], a[i]), B.pb(a[i]);
//		link(k, A), link(k, B);
		return;
	}
	if (k > 1 && f[k][n] == f[k - 1][n]) {
		link(k - 1, a);
		return;
	}
	
	int orz=++tim;
	for(int u:a)anc[u].pb(tim);
	
//	printf("#%d\n",tim);
//	for(int u:a)printf("%d ",u);
//	puts("");
	
	W o = G[k][n];
	int m = o.m, u = o.u, v = o.v, P = o.P, Q = o.Q, Z = o.Z;
	vector<int> key, le, re;
	per(i,u-1,0)add(a[i],a[u],a[i+1]);
	for (int i = 0; i < u; i++)
		le.pb(a[i]);
	link(k, le);
	for (int i = n - v; i < n; i++)
		add(a[n - v - 1], a[i],a[i-1]), re.pb(a[i]);
	link(k, re);
	key.pb(a[u]);
	int num = u;
	for (int i = 1; i <= m - 2; i++) {
		int la = num;
		num += P + 1;
		if (i <= Q) num++;
		vector<int> now;
		int X = la, Y = num;
		for (int j = X + 1; j < Y; j++) now.pb(a[j]), add(a[X], a[j],a[j-1]);
		per(j,Y-1,X+1)add(a[j],a[Y],a[j+1]);
		link(k, now);
		
		add(key.back(),a[num],a[Y-1]);
		
		key.pb(a[num]);
	}
//	for (int i = 0; i + 1 < (int)key.size(); i++) add(key[i], key[i + 1]);
	link(k - 2, key);
	
//	if(orz==1){
//	  printf("### %d %d\n",n-v,n-1);
//	  printf("[%d %d]\n",key[0],key.back());
//  }
	
	twi[orz]=key;
}

void solve() {
	read(n), k=3; ++n;	
	work();
	vector<int> t;
	for (int i = 0; i < n; i++) t.pb(i);
	link(k, t);
	printf("%d\n", m); //chk(); return 0;
	
////	static int dou[N];
////	rep(i,1,m)dou[e[i].fi]++;
//	int mx=0;
////	rep(i,0,n-1)chkmax(mx,dou[i]);
//	rep(i,0,n-1)chkmax(mx,(int)anc[i].size());
//	cout<<mx<<endl;
//	return;

  rep(i,0,n-2)g[i][i+1]=1;
	
	for(auto[a,b,c]:out)printf("%d %d %d\n",a,b,c);
//	for (int i = 1; i <= m; i++) printf("%d %d\n", e[i].fi, e[i].se);
	fflush(stdout);
	
	int q;
	read(q);
	while(q--){
	  fflush(stdout);
	  int l,r;
	  read(l),read(r);
	  
	  if(g[l][r]){
	    printf("%d %d\n",l,r);
	    continue;
    }
    if(l+2==r){
      printf("%d %d %d\n",l,l+1,l+2);
      continue;
    }
    if(l+3==r){
      printf("%d %d %d %d\n",l,l+1,l+2,l+3);
      continue;
    }
    int clo=0;
    per(_,anc[l].size()-1,0){
      int x=anc[l][_];
      auto it=lower_bound(ALL(anc[r]),x);
      if(it!=anc[r].end()&&*it==x){
        clo=x;break;
      }
    }
//    printf("!%d\n",clo);
    vi&key=twi[clo];
    int lef=*lower_bound(ALL(key),l);
//    printf("#%d\n",lef);
    int rig=*--upper_bound(ALL(key),r);
//    printf("$%d\n",rig);
    assert(l==lef||g[l][lef]);
    assert(rig==r||g[rig][r]);
    assert(lef==rig||g[lef][rig]);
    
    vi vec;
    vec.pb(l);
    vec.pb(lef);
    vec.pb(rig);
    vec.pb(r);
    vec.erase(unique(ALL(vec)),vec.end());
    for(int x:vec)printf("%d ",x);
    puts("");
  }
  fflush(stdout);
	
}

signed main(){
//  freopen(".in","r",stdin);
//  freopen(".out","w",stdout);
//  int T;cin>>T;while(T--)solve();
  solve();
  orzjk::flush();
  return 0;
}