#include <algorithm>
#include <bit>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>
#include <string>

using namespace::std;

template <typename T>
void print(const T& v) {
 for (const auto& x : v) cout << x << " ";
 cout << endl;
}

int main() {
  ios::sync_with_stdio(false);
  long long n;
  cin >> n;
  set<tuple<int, int, int>> s;
  for (long long x = 0; 3 * x * x <= n; ++x)
    for (long long y = max(x, 1ll); 2 * x * y + y * y <= n; ++y) {
       long long z = (n - x * y) / (x + y);
       if (x * y + y * z + z * x == n) {
          s.insert({x, y, z});
          s.insert({x, z, y});
          s.insert({y, x, z});
          s.insert({y, z, x});
          s.insert({z, x, y});
          s.insert({z, y, x});
        }
    }
  
  cout << s.size() << endl;
  for (const auto& [x, y, z] : s)
    cout << x << " " << y << " " << z << "\n";
  return 0;
}