#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long n; cin >> n;
	vector<long long>mn(3, LINF);
	mn[0] = n + 1;
	const int LIM = 200000;

	vector<long long>cand;
	rep2(i, 1, 200001) if (0 == n % i)cand.push_back(i);

	int p0 = -1, q0 = -1;
	rep(i, cand.size())rep(j, cand.size()) {
		long long x = cand[i] * cand[j];
		long long y = cand[i] + cand[j];
		if (n != x) continue;
		if (y + 2 <= LIM) {
			if (chmin(mn[1], y + 2)) {
				p0 = cand[i];
				q0 = cand[j];
			}
		}
	}
	int p1 = -1, q1 = -1, r1 = -1;
	rep(i, cand.size())rep(j, cand.size()) rep(k, cand.size()) {
		long long x = cand[i] * cand[j] * cand[k];
		long long y = cand[i] + cand[j] + cand[k];
		if (n != x) continue;
		if (y + 3 <= LIM) {
			if (chmin(mn[2], y + 3)) {
				p1 = cand[i];
				q1 = cand[j];
				r1 = cand[k];
			}
		}
	}
	long long mnn = LINF;
	rep(i, 3)chmin(mnn, mn[i]);
	if (mnn > 200000) {
		cout << -1 << endl;
		return 0;
	}
	cout << mnn << endl;
	if (mnn == mn[0]) {
		rep(i, mnn - 1)cout << i + 1 << " " << mnn - 1 << endl;
		vector<char>c(mnn, 'g');
		c[mnn - 1] = 'b';
		rep(i, mnn)cout << c[i] << " ";
		cout << endl;
	}
	else if (mnn == mn[1]) {
		rep(i, p0)cout << i + 1 << " " << p0 + q0 + 1 << endl;
		rep(i, q0)cout << i + 1 + p0 << " " << p0 + q0 + 2 << endl;
		cout << p0 + q0 + 1 << " " << p0 + q0 + 2 << endl;
		vector<char>c(mnn, 'g');
		c[mnn - 2] = 'b';
		c[mnn - 1] = 'b';
		rep(i, mnn)cout << c[i] << " ";
		cout << endl;
	}
	else {
		rep(i, p1)cout << i + 1 << " " << p1 + q1 + r1 + 1 << endl;
		rep(i, q1)cout << i + 1 + p1 << " " << p1 + q1 + r1 + 2 << endl;
		rep(i, r1)cout << i + 1 + p1 + q1 << " " << p1 + q1 + r1 + 3 << endl;
		cout << p1 + q1 + r1 + 1 << " " << p1 + q1 + r1 + 2 << endl;
		cout << p1 + q1 + r1 + 2 << " " << p1 + q1 + r1 + 3 << endl;
		vector<char>c(mnn, 'g');
		c[mnn - 3] = 'b';
		c[mnn - 2] = 'b';
		c[mnn - 1] = 'b';
		rep(i, mnn)cout << c[i] << " ";
		cout << endl;
	}
	return 0;
}