#include <iostream>
#include <cmath>
#include <utility>

using namespace std;

#define mp make_pair
#define x first
#define y second
typedef pair<int,int> pii;
typedef long long ll;

int arr[66];
ll niz[122],pom[122];

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	niz[60]=1ll;
	int br=0;
	ll n;
	cin>>n;
	while(niz[60]<=n){
		for(int i=1;i<120;i++){
			pom[i]=niz[i]+niz[i-1]+niz[i+1];
		}
		for(int i=1;i<120;i++){
			niz[i]=pom[i];
		}
		br++;
	}
	if(n==0){
		cout<<0<<"\n"<<"0 0";
		return 0;
	}
	int i=61;
	while(n){
		arr[i-60]=n/niz[i];
		n=n%niz[i];
		i++;
	}
	int mx=0;
	for(int i=1;i<60;i++){
		cout<<arr[i]<<" ";
		mx=max(mx,arr[i]);
	}
	cout<<120*mx<<"\n";
	for(int i=0;i<mx;i++){
		for(int j=0;j<120;j++){
			if(j==60) cout<<2*i<<" "<<j<<" 1\n";
			else cout<<2*i<<" "<<j<<" 0\n";
		}
	}
	int sum=0;
	for(int i=1;i<60;i++) sum+=arr[i];
	cout<<sum<<" "<<br<<"\n";
	for(int i=0;i<mx;i++){
		for(int j=1;j<60;j++){
			if(arr[j]>i) cout<<2*i<<" "<<60+j<<"\n";
		}
	}
	



return 0;
}