#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
pair<long long, long long> ps[300010];
long long x;
int main() {
  cin >> x;
  if (x == 1) {
    puts("1\n1 1");
    return 0;
  }
  ps[0].first = 1, ps[0].second = x;
  bool f1 = 0;
  long long c = 2, f2 = 0;
  int t = 1;
  while (1) {
    long long re = x - 1ll * c * (c - 1) * (2 * c - 1) / 6;
    long long p = 1ll * c * (c - 1) / 2;
    re += 1ll * c * p;
    long long m1 = re % (1ll * c * c - p);
    long long m = re / (1ll * c * c - p);
    if (c > m) break;
    if (!m1) {
      if (c == m)
        f2 = c;
      else
        ps[t++] = make_pair(c, m);
    }
    c++;
  }
  if (f2)
    cout << (2 * t + 1) << endl;
  else
    cout << (2 * t) << endl;
  for (int i = 0; i < t; i++) {
    cout << ps[i].first << " " << ps[i].second << endl;
  }
  if (f2) cout << f2 << " " << f2 << endl;
  for (int i = t - 1; i >= 0; i--) {
    cout << ps[i].second << " " << ps[i].first << endl;
  }
  return 0;
}

### Prompt

Please create a solution in cpp to the following problem:

Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked you to find all pairs of n and m, such that there are exactly x distinct squares in the table consisting of n rows and m columns. For example, in a 3 × 5 table there are 15 squares with side one, 8 squares with side two and 3 squares with side three. The total number of distinct squares in a 3 × 5 table is 15 + 8 + 3 = 26.

Input

The first line of the input contains a single integer x (1 ≤ x ≤ 1018) — the number of squares inside the tables Spongebob is interested in.

Output

First print a single integer k — the number of tables with exactly x distinct squares inside.

Then print k pairs of integers describing the tables. Print the pairs in the order of increasing n, and in case of equality — in the order of increasing m.

Examples

Input

26


Output

6
1 26
2 9
3 5
5 3
9 2
26 1


Input

2


Output

2
1 2
2 1


Input

8


Output

4
1 8
2 3
3 2
8 1

Note

In a 1 × 2 table there are 2 1 × 1 squares. So, 2 distinct squares in total.

<image>

In a 2 × 3 table there are 6 1 × 1 squares and 2 2 × 2 squares. That is equal to 8 squares in total.

<image>

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
pair<long long, long long> ps[300010];
long long x;
int main() {
  cin >> x;
  if (x == 1) {
    puts("1\n1 1");
    return 0;
  }
  ps[0].first = 1, ps[0].second = x;
  bool f1 = 0;
  long long c = 2, f2 = 0;
  int t = 1;
  while (1) {
    long long re = x - 1ll * c * (c - 1) * (2 * c - 1) / 6;
    long long p = 1ll * c * (c - 1) / 2;
    re += 1ll * c * p;
    long long m1 = re % (1ll * c * c - p);
    long long m = re / (1ll * c * c - p);
    if (c > m) break;
    if (!m1) {
      if (c == m)
        f2 = c;
      else
        ps[t++] = make_pair(c, m);
    }
    c++;
  }
  if (f2)
    cout << (2 * t + 1) << endl;
  else
    cout << (2 * t) << endl;
  for (int i = 0; i < t; i++) {
    cout << ps[i].first << " " << ps[i].second << endl;
  }
  if (f2) cout << f2 << " " << f2 << endl;
  for (int i = t - 1; i >= 0; i--) {
    cout << ps[i].second << " " << ps[i].first << endl;
  }
  return 0;
}

```