#include<bits/stdc++.h>
using namespace std;

vector<array<int,3>> tiles;
vector<array<int,2>> sol;
int maxi=0;

void add(int pot,int maxpot){
    int x = 62*pot, y = 0;
    
    tiles.push_back({x,y,1});
    for(int i=0;i<maxpot-pot;i++){
        y++;
        tiles.push_back({x,y,0});
    }
    
    for(int i=0;i<=pot;i++){
        for(int j=0;j<=pot-i;j++){
            if(j==pot-i)sol.push_back({x+i,y+j});
            
            if(i==0 && j==0)continue;
            tiles.push_back({x+i,y+j,0});
        }
    }
}

void solve(int t){
    long long n;
    cin>>n;
    
    if(n==0){
        cout<<"0\n0 0\n";
        return;
    }
    
    for(int i=60;i>=0;i--){
        if(n&(1ll<<i)){
            maxi=max(maxi,i);
            add(i,maxi);
        }
    }
    
    cout<<tiles.size()<<"\n";
    for(auto [x,y,c] : tiles)cout<<x<<" "<<y<<" "<<c<<"\n";
    cout<<sol.size()<<" "<<maxi<<"\n";
    for(auto [x,y] : sol)cout<<x<<" "<<y<<"\n";
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    /*
    int dim = 20;
    auto mat = vector(dim,vector<int>(dim));
    
    mat[0][0]=1;
    for(int i=0;i<dim/2;i++){
        auto tmp = mat;
        for(int j=0;j<dim;j++){
            for(int k=0;k<dim;k++){
                
                if(j-1>=0)
                tmp[j][k]+=mat[j-1][k];
                if(k-1>=0)
                tmp[j][k]+=mat[j][k-1];
                if(j+1<10)
                tmp[j][k]+=mat[j+1][k];
                if(k+1<10)
                tmp[j][k]+=mat[j][k+1];    
            }
        }
            
        mat = tmp;
    }
    
    for(int i=0;i<dim;i++){
        for(int j=0;j<dim;j++){
            cout<<mat[i][j]<<"\t";
        }
        cout<<"\n";
    }
    
    return 0;
     */
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}