#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=100010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;
double pi=M_PI;


void solve(){
    ll a;cin>>a;
    vector<vector<ll> >G(119);
    ll m=0;
    REP(i,1,39){
        G[i*3].pb(i*3+3);
        m++;
    }
    G[0].pb(1),G[0].pb(2);
    m+=2;
    rep(i,38){
        G[i*3+1].pb(i*3+4);
        G[i*3+1].pb(i*3+5);
        G[i*3+2].pb(i*3+4);
        G[i*3+2].pb(i*3+5);
        m+=4;
    }
    if(a%2){
        G[0].pb(3);
        m++;
    }
    rep(j,39){
        if((1LL<<(j+1))&a){
            if(j<38){
                G[j*3+1].pb(j*3+6);
                G[j*3+2].pb(j*3+6);
            }else{
                G[j*3+1].pb(118);
                G[j*3+2].pb(118);
            }
            m+=2;
        }
    }
    G[117].pb(118);
    m++;
    m++;
    cout<<120<<' '<<m<<endl;
    cout<<1<<' '<<2<<endl;
    rep(i,119){
        rep(j,G[i].size()){
            cout<<i+2<<' '<<G[i][j]+2<<endl;
        }
    }
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}