#include <bits/stdc++.h>
#define GET_MACRO(_1,_2,_3,_4,_5,_6,_7,_8,NAME,...) NAME
#define pr(...) cerr<< GET_MACRO(__VA_ARGS__,pr8,pr7,pr6,pr5,pr4,pr3,pr2,pr1)(__VA_ARGS__) <<endl
#define pr1(a) (#a)<<"="<<(a)<<" "
#define pr2(a,b) pr1(a)<<pr1(b)
#define pr3(a,b,c) pr1(a)<<pr2(b,c)
#define pr4(a,b,c,d) pr1(a)<<pr3(b,c,d)
#define pr5(a,b,c,d,e) pr1(a)<<pr4(b,c,d,e)
#define pr6(a,b,c,d,e,f) pr1(a)<<pr5(b,c,d,e,f)
#define pr7(a,b,c,d,e,f,g) pr1(a)<<pr6(b,c,d,e,f,g)
#define pr8(a,b,c,d,e,f,g,h) pr1(a)<<pr7(b,c,d,e,f,g,h)
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL<<55)+1e9; // ~ 3.6 * 1e16
const Int mod = (1e9)+7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int,Int>;
using Tu = tuple<Int,Int,Int>;
template<class T> T Max(T &a,T b){return a=max(a,b);}
template<class T> T Min(T &a,T b){return a=min(a,b);}
template<class T1, class T2> ostream& operator<<(ostream& o,pair<T1,T2> p){return o<<"("<<p.first<<","<<p.second<<")";}
template<class T1, class T2, class T3> ostream& operator<<(ostream& o,tuple<T1,T2,T3> t){
  return o<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class T1, class T2> istream& operator>>(istream& i,pair<T1,T2> &p){return i>>p.first>>p.second;}
template<class T> ostream& operator<<(ostream& o,vector<T> &a){Int i=0;for(T t:a)o<<(i++?" ":"")<<t;return o;}
template<class T> istream& operator>>(istream& i,vector<T> &a){for(T &t:a)i>>t;return i;}
template<class T>void prArr(T a,string s=" "){Int i=0;for(auto t:a)cout<<(i++?s:"")<<t;cout<<endl;}

vector<vector<P> > G(20);
Int n = 20;
const Int S = 0;
const Int T = 19;
const Int limit = 0;

void add_edge(int from,int to,int cost){G[from].push_back(P(to, cost));}

void add(Int L,Int sum = 0){
  if(L < 0) return;
  if( L <= limit ){
    for(int i=0;i<=L;i++) add_edge(S, T, sum + i);
    return;
  }
  
  vector<Int> num;
  {
    int x = limit+1, tmp = L - limit;
    while(tmp >= 0){
      num.push_back(x);
      tmp -= x;
      x *= 2;
    }
    if(tmp != 0) num.pop_back();
    while(T - (int)num.size() <= 0) num.pop_back();
  }
  int s = accumulate(num.begin(), num.end(), 0LL);
  add_edge(S, T - num.size(), sum);
  add(L - s - limit - 1, sum + s + limit + 1);
}

void check(Int L){
  vector<Int> S;
  function<void(Int,Int)> dfs = [&](Int pos,Int sum){
    if(pos == n-1) S.push_back(sum);
    for(auto e:G[pos]){
      Int to, cost; tie(to, cost) = e;
      dfs(to, sum + cost);
    }
  };
  Int M = 0;
  for(Int i=0;i<n;i++) M += G[i].size();
  assert(M <= 60);
  
  dfs(0, 0);
  assert((int)S.size() == L);
  sort(S.begin(), S.end());
  S.erase(unique(S.begin(), S.end()), S.end());
  assert((Int)S.size() == L);
}

void printG(){
  Int M = 0;
  for(Int i=0;i<n;i++) M += G[i].size();
  cout<<n<<" "<<M<<endl;
  for(Int i=0;i<n;i++){
    for(auto p:G[i]){
      Int to, cost; tie(to, cost) = p;
      cout<<i+1<<" "<<to+1<<" "<<cost<<endl;
    }
  }
}

void solve(int L){
  for(int i = 0 ;i<n;i++) G[i].clear();
  
  for(Int i=1;i<T;i++){
    add_edge(i, i+1, (1<<(n-i-2)));
    add_edge(i, i+1, 0);
  }
  add(L-1);
  printG();
  check(L);  
}

signed main(){
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);

  Int L;
  cin>>L;
  solve(L);
  return 0;
}


Measured memory_bytes: 10092