#include <bits/stdc++.h>
using namespace std;
// #include <atcoder/modint>
// using namespace atcoder;
// using mint = modint998244353;
using ll = unsigned long long;
#define fix(x) fixed << setprecision(x)
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    vector<tuple<int,ll,ll>> ans;
    for(ll i=1;i*i<=n*2;++i){
        if(n*2%i==0){
            ll m = n*2/i;
            if((m-i+1)%2==0){
                ll k = (m-i+1)/2;
                ans.emplace_back(1,k-1,k+i-1);
            }
        }
    }
    for(int t=2;t<=39;++t){
        vector<ll> tot(1,0);
        for(ll i=1;;++i){
            ll x = 1;
            rep(_,t){
                if(x>n/i){
                    x = 0;
                    break;
                }
                x *= i;
            }
            if(x==0) break;
            tot.emplace_back(x);
            tot[i] += tot[i-1];
        }
        unordered_map<ll,int> mp;
        rep(i,(int)tot.size()){
            if(mp.count(tot[i]-n)){
                ans.emplace_back(t, mp[tot[i]-n], i);
            }
            mp[tot[i]] = i;
        }
    }
    cout << ans.size() << '\n';
    for(auto [t,p,q]:ans) cout << t << " " << p+1 << " " << q << '\n';
    return 0;
}