#include <iostream>
#include <vector>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<deque>
#include<map>
#include<bitset>
#include<math.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,m,n) for(ll i=m;i<(ll)(n);i++)
typedef pair<int,long long> pint;
typedef long long ll;
const ll mod= 1e9+7;
const int inf=1e9+7;
const ll  longinf = 1LL<<60;
int dx[4]={1,0,-1,0}, dy[4]={0,1,0,-1};

int main(){
  int n;cin>>n;
  vector<pint> v;
  rep(i,31)REP(j,i+1,31){
    v.push_back({i+1,j+1});
    }
  rep(i,32){
    if((n>>i)&1)v.push_back({i+2,32});
    }
  cout<<32<<" "<<v.size()<<endl;
  rep(i,v.size()){
    cout<<v[i].first<<" "<<v[i].second<<endl;
    }
  
 
  return 0;
  }