#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7, maxn = 100005, ln = 18;
const int inf = int(1e9), shift = 30, etf = mod - 1;
vector<pair<unsigned long long int, unsigned long long int> > vec;
int main() {
  unsigned long long int x, n, m, p = 1, q = 2000000, mid, cal, ans = 0;
  cin >> x;
  while (p != q) {
    mid = (p + q) >> 1;
    cal = (mid * (mid + 1) * (2 * mid + 1)) / 6;
    if (cal < x)
      p = mid + 1;
    else
      q = mid;
  }
  cal = (p * (p + 1) * (2 * p + 1)) / 6;
  if (cal >= x) p--;
  if (cal == x) ans++;
  for (int i = 1; i < p + 1; i++) {
    q = i;
    if ((6 * x) % (q * (q + 1)) == 0) {
      mid = (((6 * x) / (q * (q + 1))) + q - 1);
      if (mid % 3 == 0) {
        mid /= 3;
        vec.push_back(
            pair<unsigned long long int, unsigned long long int>(mid, i));
      }
    }
  }
  ans += 2 * (int)vec.size();
  cout << ans << endl;
  for (int i = 0; i < vec.size(); i++) {
    cout << vec[i].second << " " << vec[i].first << endl;
  }
  if (cal == x) cout << p + 1 << " " << p + 1 << endl;
  for (int i = vec.size() - 1; i >= 0; i--) {
    cout << vec[i].first << " " << vec[i].second << endl;
  }
  return 0;
}
