#include<bits/stdc++.h>
using namespace std;
#define int long long
#define f first
#define s second
const int N = (1 << 16) + 69;
set<pair<int, int>> was;
vector<tuple<int, int, int>> edges; 
vector<int> g[N];
int n, q;
void solve(int l, int r, int B) {
	vector<int> c;
	for (int i = l;i <= r;i += B - 1)
		c.push_back(i);
	if (c.back() != r)
		c.push_back(r);
	for (int j = 1;j < (int)c.size();j++) {
		int l = c[j - 1], r = c[j];
		for (int i = r - 1;i >= l;i--) {
			if (was.count({i, r}))
				continue;
			was.insert({i, r});
			g[i].push_back(r);
			edges.push_back({i, i + 1, r});
		}
	}
	for (int j = 1;j < (int)c.size();j++) {
		int l = c[j - 1], r = c[j];
		for (int i = l + 1;i <= r;i++) {
			if (was.count({l, i}))
				continue;
			was.insert({l, i});
			g[l].push_back(i);
			edges.push_back({l, i - 1, i});
		}
	}
	for (int i = (int)c.size() - 1;i >= 0;i--) {
		for (int j = i + 1;j < (int)c.size();j++) {
			if (was.count({c[i], c[j]}))
				continue;
			was.insert({c[i], c[j]});
			g[c[i]].push_back(c[j]);
			edges.push_back({c[i], c[j - 1], c[j]});
		}
	}
}

signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
		cin >> n;
		for (int i = 1;i <= n;i++) {
			was.insert({i - 1, i});
			g[i - 1].push_back(i);
		}
		solve(0, n, 256);
		for (int i = 0;i <= n;i += 255) 
			solve(i, min(n, i + 255), 16);
		for (int i = 0;i <= n;i += 15)
			solve(i, min(n, i + 15), 4);
		cout << edges.size() << endl;
		for (auto u : edges) {
			int a, b, c;
			tie(a, b, c) = u;
			cout << a << " " << b << " " << c << endl;
		}
		cin >> q;
		while (q--) {
			int x, y;
			cin >> x >> y;
			int t = x;
			int cc = 0;
			while (t != y) {
				int mx = 0, s = 0;
				cout << t << " ";
				cc++;
				for (auto u : g[t]) {
					if (u == y) {
						t = y;
						break;
					}
					if (u > mx && u <= y) {
						mx = u;
						s = u;
					}
				}
				if (t != y)
					t = s;
				cc++;
				if (cc > 4)
					break;
			}
			cout << y << endl;
		}
  }
  return 0;
}