#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <tuple>
#include <cstdio>
#include <cmath>
#include <cassert>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int X;

signed main() {
    cin >> X;

    if (X == 1) {
        cout << 2 << endl;
        cout << "1 2" << endl;
        cout << "b g" << endl;
        return 0;
    }

    vector<int> a;
    for (int i = 3; i <= 200000; i++) {
        while (X % i == 0) {
            a.push_back(i);
            X /= i;
        }
    }
    while (X % 2 == 0) { a.push_back(2); X /= 2; }

    if (X > 1) {
        cout << -1 << endl;
        return 0;
    }

    int id = 0;
    vector<vector<int>> et(200000);
    vector<int> colors(200000);
    for (int i = 0; i < a.size(); i++) {
        colors[id] = 0;
        int blown = id;
        id++;
        for (int j = 0; j < a[i]; j++) {
            if (id >= 200000) {
                cout << -1 << endl;
                return 0;
            }
            et[blown].push_back(id);
            colors[id] = 1;
            id++;
        }
        if (i + 1 < a.size() && id >= 200000) {
            cout << -1 << endl;
            return 0;
        }
        if (i + 1 < a.size()) { //next chairo
            et[blown].push_back(id);
        }
    }

    cout << id << endl;
    for (int i = 0; i < id; i++) {
        for (int j = 0; j < et[i].size(); j++) {
            cout << i + 1 << " " << et[i][j] + 1 << endl;
        }
    }
    for (int i = 0; i < id; i++) {
        if (colors[i] == 0) cout << "b";
        else cout << "g";
        if (i + 1 < id) cout << " ";
    }
    cout << endl;
    return 0;
}