#include<cstdio>

#include<cmath>

#include<cstdlib>

#include<cstring>

#include<ctime>

#include<iostream>

#include<algorithm>

#include<queue>

#include<vector>

#include<map>

#define ll long long

#define ull unsigned long long

#define max(a,b) (a>b?a:b)

#define min(a,b) (a<b?a:b)

#define lowbit(x) (x& -x)

#define mod 1000000007

#define inf 0x3f3f3f3f

#define eps 1e-18

#define maxn 100010

inline ll read(){ll tmp=; char c=getchar(),f=; for(;c<''||''<c;c=getchar())if(c=='-')f=-; for(;''<=c&&c<='';c=getchar())tmp=(tmp<<)+(tmp<<)+c-''; return tmp*f;}

inline ll power(ll a,ll b){ll ans=; for(;b;b>>=){if(b&)ans=ans*a%mod; a=a*a%mod;} return ans;}

inline ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

inline void swap(int &a,int &b){int tmp=a; a=b; b=tmp;}

using namespace std;

int x[],y[],d[];

int a[],base[];

int n,m,l;

int main()

{

    l=read();

    if(l<=){//特判是因为若l<=2，下面建图是时图只有一个点，无法连边

        printf("2 %d\n",l);

        for(int i=;i<l;i++)

            printf("1 2 %d\n",i);

        return ;

    }

    int len=;

    while(<<len<=l)++len;

    n=len; m=;

    for(int i=;i<len-;i++){//二进制拆分

        x[++m]=i+; y[m]=i+; d[m]=;

        x[++m]=i+; y[m]=i+; d[m]=<<i;

    }

    for(int i=len-;i>=;i--)

        if(l&(<<i)){//其实和数位dp一样啦

            x[++m]=i+; y[m]=n; d[m]=l>>(i+)<<(i+);

        }

    printf("%d %d\n",n,m);

    for(int i=;i<=m;i++)

        printf("%d %d %d\n",x[i],y[i],d[i]);

    return ;

}