#include <bits/stdc++.h>
using namespace std;
struct Size {
  uint64_t n;
  uint64_t m;
};
bool operator==(const Size& d1, const Size& d2) {
  return (d1.n == d2.n) && (d1.m == d2.m);
}
bool operator<(const Size& d1, const Size& d2) {
  if (d1.n < d2.n) {
    return true;
  } else {
    if (d1.n == d2.n) {
      if (d1.m < d2.m) {
        return true;
      }
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  vector<uint64_t> numberSums(1442250);
  uint64_t currentSum{};
  uint64_t currentNumber{};
  for (auto& numberSum : numberSums) {
    numberSum = currentSum += ++currentNumber;
  }
  uint64_t x;
  cin >> x;
  const uint64_t x3 = x * 3;
  const uint64_t maxN =
      numberSums.rend() - lower_bound(numberSums.rbegin(), numberSums.rend(), x,
                                      greater<uint64_t>());
  vector<Size> sizes;
  for (uint64_t n = 1; n <= maxN; ++n) {
    const uint64_t numberSum = numberSums[n - 1];
    if (x3 % numberSum != 0) {
      continue;
    }
    uint64_t m = x3 / numberSum + n - 1;
    if (m % 3 == 0) {
      m /= 3;
    } else {
      continue;
    }
    if (m < n) {
      continue;
    }
    if (numberSum * (3 * m - n + 1) / 3 != x) {
      continue;
    }
    sizes.push_back({n, m});
    if (n != m) {
      sizes.push_back({m, n});
    }
  }
  sort(sizes.begin(), sizes.end());
  sizes.erase(unique(sizes.begin(), sizes.end()), sizes.end());
  cout << sizes.size() << endl;
  for (const auto& size : sizes) {
    cout << size.n << ' ' << size.m << endl;
  }
}
