#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;
}*/
int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	long long n; cin >> n;
	const int lim = 1000000;
	//vector<long long>a(lim), sa(lim + 1);
	//for (long long i = 0; i <= 1000000; ++i)a[i] = i * i * i;
	//rep(i, lim)sa[i + 1] = sa[i] + a[i];
	vector<P>ans;
	long long  r = 1;
	long long sum = 0;
	for (long long l = 1; l <= lim; ++l) {
		while (sum < n) {
			sum += r * r * r;
			r++;
		}
		//	cout << l << " " << r << endl;
		if (sum == n) {
			ans.emplace_back(l, r);
		}
		sum -= l * l * l;
	}
	cout << ans.size() << endl;
	for (auto[l, r] : ans)cout << l << " " << r - 1 << endl;
	return 0;
}