#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
template <class T, class F>
T binarySearch(T ok, T ng, const F &f) {
	while (abs(ok - ng) > 1) {
		T mid = (ok + ng) / 2;
		(f(mid) ? ok : ng) = mid;
	}
	return ok;
}
#ifdef _MSC_VER
using int128 = long long;
#else
using int128 = __int128;// 提出用
#endif
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	long long n; cin >> n;
	const int lim = 1000000;
	vector<array<long long, 3>>ans;
	// e = 1 は別処理
	{
		const int lim = 2 * 1000000;
		for (int size = 1; size < lim; ++size) {
			auto f = [&](const long long x)->bool {
				int128 l = x;
				int128 r = l + size - 1;
				int128 sum = (l + r) * size / 2;
				//cout << l << "_" << r << " " << sum << endl;
				return sum <= (int128)n;
			};
			auto l = binarySearch<long long>(0, n + 1, f);
			if (l == 0)continue;
			long long r = l + size - 1;
			long long sum = (l + r)*size / 2;
			if (sum == n)ans.push_back({ 1, l, r + 1 });
			//break;
		}
	}
	// e < 1
	{
		for (int e = 2; e <= 40; ++e) {

			long long  r = 1;
			long long sum = 0;
			for (long long l = 1; l <= lim; ++l) {
				long long x = 1;
				rep(i, e)x *= l;
				if (x > n)break;

				while (sum < n) {
					long long add = 1;
					rep(i, e)add *= r;
					sum += add;
					r++;
				}
				///cout << l << " " << r << " " << sum << endl;
				//	cout << l << " " << r << endl;
				if (sum == n) {
					ans.push_back({ e, l, r });
				}
				sum -= x;
			}
		}
	}
	sort(all(ans));
	cout << ans.size() << endl;
	for (auto[e, l, r] : ans)cout << e << " " << l << " " << r - 1 << endl;
	return 0;
}