#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
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; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll N; cin >> N;
  set<vector<ll>> st;
  // x<=y<=z
  for(ll z=1;z<=N;z++){
    for(ll y=0;y*z<=N && y<=N;y++){
      ll r = N-(y*z);
      if(r%(y+z)==0 && r/(y+z)<=y){
        ll x = r/(y+z);
        st.insert({x,y,z});
      }
    }
  }
  set<vector<ll>> ans;
  for(auto s:st){
    ans.insert(vector<ll>({s[0],s[1],s[2]}));
    ans.insert(vector<ll>({s[0],s[2],s[1]}));
    ans.insert(vector<ll>({s[1],s[0],s[2]}));
    ans.insert(vector<ll>({s[1],s[2],s[0]}));
    ans.insert(vector<ll>({s[2],s[0],s[1]}));
    ans.insert(vector<ll>({s[2],s[1],s[0]}));
  }
  int T = sz(ans);
  cout << T << '\n';
  for(auto a:ans){
    cout << a[0] << ' ' << a[1] << ' ' << a[2] << '\n';
  }
  return 0;
};