#include <bits/stdc++.h>
using namespace std;
using ll = unsigned 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;
    set<ll> se;
    ll sum = 0;
    map<ll, ll> mp;
    for (ll i = 0; i * i * i <= N; i++) {
        sum += i * i * i;
        mp[sum] = i;
        se.insert(sum);
    }
    vector<pair<ll, ll>> ans;
    for (auto x : se) {
        if (se.count(x - N)) {
            ans.push_back({mp[x - N] + 1, mp[x]});
        }
    }
    cout << (int)ans.size() << endl;
    sort(all(ans));
    for (auto [l, r] : ans) cout << l << " " << r << endl;
}

int main() {
    solve();
}