#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

ll X;
vector<int> C;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>X;
	if(X==1) {
		cout<<2<<endl;
		cout<<"1 2"<<endl;
		cout<<"b g"<<endl;
		return;
	}
	int n2=0;
	while(X%2==0) n2++,X/=2;
	while(n2>=2) C.push_back(4), n2-=2;
	if(n2) C.push_back(2);
	for(i=3;i<=200000;i++) while(X%i==0) {
		C.push_back(i);
		X/=i;
	}
	ll sum=C.size();
	FORR(c,C) sum+=c;
	if(X>1||sum>200000) {
		cout<<"-1"<<endl;
	}
	else {
		cout<<sum<<endl;
		FOR(i,C.size()-1) cout<<i+1<<" "<<i+2<<endl;
		int nex=C.size()+1;
		FOR(i,C.size()) {
			FOR(j,C[i]) cout<<i+1<<" "<<nex++<<endl;
		}
		FOR(i,C.size()) cout<<"b ";
		FOR(i,sum-C.size()) cout<<"g ";
		cout<<endl;
	}
		
	
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}