#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

bool check(vector<tuple<int,int,int>> G, int l){
  int n = 20;
  vector<vector<int>> dp(n, vector<int>(l+1, 0));
  dp[0][0] = 1;
  for(int i=0; i<n; i++){
    vector<tuple<int,int,int>> E;
    for(auto e : G){
      if( get<0>(e) == i ) E.push_back(e);
    }

    for(int d=0; d<l; d++){
      if( dp[i][d] == 0 ) continue;
      for(auto e : E){
        int nx = get<1>(e);
        int dd = d + get<2>(e);
        assert( nx > i );
        assert( dd < l );

        dp[nx][dd] += dp[i][d];
      }
    }
  }

  for(int d=0; d<l; d++){
    if( dp[n-1][d] != 1 ){
      eprintln(d, dp[n-1][d]);
      assert(dp[n-1][d] == 1);
    }
  }

  assert( G.size() <= 60 );
  return true;
}

int main(){
  int l;
  cin >> l;

  vector<int> bits;
  for(int i=0; i<20; i++){
    if((l>>i)&1){
      bits.push_back(i);
    }
  }

  using e = tuple<int,int,int>;
  vector<e> G;
  if(l<(1<<19)){
    map<int,int> hoge;
    for(int i=1; i<19; i++){
      G.emplace_back(i,i+1, 0);
      G.emplace_back(i,i+1, 1<<(18-i) );

      hoge[1<<(19-i)] = i;
    }

    hoge[1] = 18;
    reverse(bits.begin(), bits.end());
    G.emplace_back(0, hoge[1<<(bits[0])], 0);

    int tmp = 0;
    for(int i=0; i<bits.size(); i++){
      tmp |= 1<<bits[i];
      if(i+1<bits.size()){
        if( bits[i+1] == 0 ){
          G.emplace_back(0, 19, tmp);
        }else{
          G.emplace_back(0, hoge[1<<(bits[i+1])], tmp);
        }
      }else{
        // G.emplace_back(0, 19, tmp);
      }
    }
  }else{
    map<int,int> hoge;
    for(int i=1; i<19; i++){
      G.emplace_back(i,i+1, 0);
      G.emplace_back(i,i+1, 1<<(19-i) );
      hoge[1<<(20-i)] = i;
    }
    G.emplace_back(18,19, 1);
    G.emplace_back(18,19, 3);
    hoge[2] = 19;

    reverse(bits.begin(), bits.end());

    G.emplace_back(0, hoge[1<<(bits[0])], 0);

    int tmp = 0;
    for(int i=0; i<bits.size(); i++){
      tmp |= 1<<bits[i];
      if(i+1<bits.size()){
        if( bits[i+1] == 0 ){
          G.emplace_back(0, 19, tmp);
        }else{
          if( bits[i+1] == 1 ){
            G.emplace_back(0, 19, tmp);
            G.emplace_back(0, 19, tmp+1);
          }else{
            G.emplace_back(0, hoge[1<<(bits[i+1])], tmp);
          }
        }
      }else{
        // G.emplace_back(0, 19, tmp);
      }
    }
  }

  check(G, l);

  println(20, G.size());
  for(int i=0; i<G.size(); i++){
    int u,v,w;
    tie(u,v,w) = G[i];
    println(u+1, v+1, w);
  }
  return 0;
}


Measured memory_bytes: 82304