#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
using p = pair<ll, ll>;
void solve(){
    
}
ll inf = 4e18;
ll sum(ll i){
    ll t = i*(i+1)/2;
    if(t <= 1e9){
        return t*t;
    }else{
        return inf;
    }
}

int main(){
    ll n; cin >> n;
    vector<p> ans;
    queue<ll> q;
    ll s = 0;
    for(ll r = 1; r*r*r <= n; r++){
        q.push(r);
        while(s > n - r*r*r){
            auto u = q.front(); q.pop();
            s -= u*u*u;
        }s += r*r*r;
        if(s == n)ans.push_back({q.front(), r});
    }
    cout << ans.size() << endl;
    for(auto p : ans)cout << p.first << " " << p.second << endl;

    return 0;
}