#include <bits/stdc++.h>
void pre();
void post();
using namespace std;
const int MAXN = 1234567;
const int INF = 1000000123;
long long x;
void read() { cin >> x; }
long long summa[1442252];
int main() {
  pre();
  read();
  long long speed = 1;
  vector<pair<long long, long long> > ans;
  ans.reserve(1442252);
  for (long long i = 1; i < 1442252; i++) {
    summa[i] = summa[i - 1] + i * i;
  }
  for (long long i = 1; i + (x - summa[i]) / speed >= i; i++) {
    speed = (i) * (i + 1) / 2;
    if ((x - summa[i]) % speed == 0) {
      ans.push_back(make_pair(i, i + (x - summa[i]) / speed));
    }
  }
  int sizes2 = ans.size();
  for (int i = 0; i < sizes2; i++) {
    ans.push_back(make_pair(ans[i].second, ans[i].first));
  }
  sort(ans.begin(), ans.end());
  ans.erase(unique(ans.begin(), ans.end()), ans.end());
  cout << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++) {
    printf("%I64d %I64d\n", ans[i].first, ans[i].second);
  }
  post();
  return 0;
}
void pre() { return; }
void post() {}
