#include <bits/stdc++.h>
using namespace std;
template<class T> T pow_mod(T A, T N, T M) {
	T res = 1 % M;
	A %= M;
	while (N) {
		if (N & 1) res = (res * A) % M;
		A = (A * A) % M;
		N >>= 1;
	}
	return res;
}

bool is_prime(long long N) {
	if (N <= 1) return false;
	if (N == 2 || N == 3) return true;
	if (N % 2 == 0) return false;
	vector<long long> A = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
	long long s = 0, d = N - 1;
	while (d % 2 == 0) {
		++s;
		d >>= 1;
	}
	for (auto a : A) {
		if (a % N == 0) return true;
		long long t, x = pow_mod<__int128_t>(a, d, N);
		if (x != 1) {
			for (t = 0; t < s; ++t) {
				if (x == N - 1) break;
				x = __int128_t(x) * x % N;
			}
			if (t == s) return false;
		}
	}
	return true;
}	
long long pollard(long long N) {
	if (N % 2 == 0) return 2;
	if (is_prime(N)) return N;
	long long step = 0;
	auto f = [&](long long x) -> long long {
		return (__int128_t(x) * x + step) % N;
	};
	while (true) {
		++step;
		long long x = 1, y = f(x);
		while (true) {
			long long p = gcd(y - x + N, N);
			if (p == 0 || p == N) break;
			if (p != 1) return p;
			x = f(x);
			y = f(f(y));
		}
	}
}

vector<long long> prime_factorize(long long N) {
	if (N == 1) return {1};
	long long p = pollard(N);
	if (p == N) return {p};
	vector<long long> left = prime_factorize(p);
	vector<long long> right = prime_factorize(N / p);
	left.insert(left.end(), right.begin(), right.end());
	sort(left.begin(), left.end());
	return left;
}
const long long N_MAX = 200000;
int main(){
	long long X;
	cin >> X;
	auto P = prime_factorize(X);
	while ((int) P.size() >= 2){
		sort(P.rbegin(), P.rend());
		long long l = P.back();
		P.pop_back();
		long long r = P.back();
		if (l * r + 1 <= l + r + 2){
			P.pop_back();
			P.push_back(l * r);
		} else {
			P.push_back(l);
			break;
		}
	}
	if (accumulate(P.begin(), P.end(), 0LL) + P.size() <= N_MAX){
		cout << accumulate(P.begin(), P.end(), 0) + P.size() << endl;
		for (int i = 0; i < (int) P.size() - 1; i++){
			cout << i + 1 << ' ' << i + 2 << endl;
		}
		int cnt = P.size();
		for (int i = 0; i < (int) P.size(); i++){
			for (int j = 0; j < P[i]; j++){
				cnt++;
				cout << i + 1 << ' ' << cnt << endl;
			}
		}
		for (int i = 0; i < (int) P.size(); i++){
			cout << "b ";
		}
		for (int i = 0; i < accumulate(P.begin(), P.end(), 0); i++){
			cout << "g ";
		}
		cout << endl;
	} else {
		cout << -1 << endl;
	}
}