#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = (ll)s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define TT template <typename T>
template <class T1, class T2>
bool chmin(T1& x, T2 y) { return x > y ? (x = y, true) : false; }
template <class T1, class T2>
bool chmax(T1& x, T2 y) { return x < y ? (x = y, true) : false; }

struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
        srand(time(NULL));
    }
} io_setup;

void solve() {
    ll N;
    cin >> N;
    auto f = [&](ll x, ll y) -> ll {
        ll ret = 1;
        while (y > 0) {
            if (y & 1) ret *= x;
            x *= x;
            y >>= 1;
        }
        return ret;
    };
    vector<tuple<ll, ll, ll>> ans;
    rep(E, 1, 41) {
        if (E == 1) {
            for (ll x = 1; x * x <= 2 * N; x++) {
                if ((2 * N) % x != 0) continue;
                ll a = x, b = 2 * N / x;
                if ((a + b) % 2 == 0) continue;
                ll r = (a + b - 1) / 2, l = b - r;
                assert(l <= r);
                if (0 < l) ans.push_back({E, l, r});
            }
        } else {
            set<ll> se;
            ll sum = 0;
            map<ll, ll> mp;
            for (ll i = 0;; i++) {
                ll s = f(i, E);
                if (s > N) break;
                sum += s;
                mp[sum] = i;
                se.insert(sum);
            }
            for (auto x : se) {
                if (se.count(x - N)) {
                    ans.push_back({E, mp[x - N] + 1, mp[x]});
                }
            }
        }
        sort(all(ans));
    }
    cout << (int)ans.size() << endl;
    for (auto [e, l, r] : ans) cout << e << " " << l << " " << r << endl;
}

int main() {
    solve();
}