#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
// using namespace atcoder;
#define rep(i, a, n) for(int i = a; i < n; i++)
#define rrep(i, a, n) for(int i = a; i >= n; i--)
#define inr(l, x, r) (l <= x && x < r)
#define ll long long
#define ld long double

// using mint = modint1000000007;
// using mint = modint998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1e18;

template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

int main(){
    ll x; cin >> x;
    if(x == 1){
        cout << "2" << endl;
        cout << "1 2" << endl;
        cout << "b g" << endl;
        return 0;
    }

    vector<ll> p, q;
    ll sum_q = 0, sum_p = 200001;
    auto f = [&](auto self, ll y) -> void {
        if(y == 1){
            if(sum_p > sum_q){
                p = q;
                sum_p = sum_q;
            }
        }

        if(sum_q+q.size()+(y+1) <= sum_p){
            p = q;
            sum_p = sum_q;
            sum_p += y;
            p.push_back(y);
        }

        int start = 2;
        if(!q.empty()) start = q.back();
        ll last = min(200000LL, (ll)sqrt(y+1)+1);
        // cout << y << ' ' << start << ' ' << last << endl;
        rep(i, start, last){
            if(y%i == 0 && sum_q+q.size()+(i+1) < sum_p){
                q.push_back(i);
                sum_q += i;
                self(self, y/i);
                q.pop_back();
                sum_q -= i;
            }
        }
    };

    f(f, x);
    if(sum_p > 200000){
        cout << -1 << endl;
        return 0;
    }
    int n = (int)p.size();
    cout << sum_p+n << endl;
    int adj = n+1;
    rep(i, 0, n){
        if(i > 0) cout << i << ' ' << i+1 << endl;
        rep(j, 0, p[i]){
            cout << i+1 << ' ' << adj++ << endl;
        }
    }
    rep(i, 0, n){
        cout << 'b' << ' ';
    }
    rep(i, 0, sum_p){
        cout << 'g' << ' ';
    }
    cout << endl;

    
    return 0;
}