#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define Unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
struct settings{settings(){ios_base::sync_with_stdio(0); cin.tie(0); cout<<fixed<<setprecision(15);};}settingss;
const double PI = acos(-1);
const int INF = 1001001001;
const ll LINF = 1001001001001001001LL;

vvll ans;

int main() {
  ll N; cin >> N;
  // x <= y <= z
  for(ll x = 0; x*x <= N; ++x) {
    for(ll y = x; y*y <= N; ++y) {
      if(x*y > N) break;
      if(x+y == 0) continue;
      if((N - x*y) % (x+y) == 0) {
        ll z = (N - x*y) / (x+y);
        if(z < y) break;
        vll tmp = {x, y, z};
        do {
          ans.push_back(tmp);
        } while(next_permutation(all(tmp)));
      }
    }
  }
  cout << ans.size() << endl;
  fore(a, ans) {
    cout << a[0] << ' ' << a[1] << ' ' << a[2] << endl;
  }
}