#include <bits/stdc++.h>
using namespace std;
bool compare(pair<long long, long long>& a, pair<long long, long long>& b) {
  if (a.first != b.first) return (a.first < b.first);
  return (a.second < b.second);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long X;
  cin >> X;
  vector<pair<long long, long long>> ans, ans2;
  long long n = 1;
  while (n <= (floor(2 * cbrt(X)) < floor(sqrt(X)) ? floor(2 * cbrt(X))
                                                   : floor(sqrt(X)))) {
    long long num = 6 * X + (n * n * n) - n;
    long long den = 3 * ((n * n) + n);
    if (num % den == 0 && n <= num / den) {
      ans.push_back(pair<long long, long long>(n, num / den));
      if (n != num / den)
        ans.push_back(pair<long long, long long>(num / den, n));
    }
    n++;
  }
  sort(ans.begin(), ans.end(), compare);
  cout << ans.size() << "\n";
  for (int i = int(0); i <= int(ans.size() - 1); i++)
    cout << ans[i].first << " " << ans[i].second << "\n";
}
