#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n;cin >> n;
    set<pair<pl,ll>> st;
    for(ll i=0;i*i<=n;i++){
        for(ll j=0;j*j<=n;j++){
            ll p=n-i*j;
            ll q=(i+j);
            if(q==0)continue;
            if(p%q)continue;
            if(p/q<0)continue;
            ll k=p/q;
            st.insert({{i,j},k});
            st.insert({{i,k},j});
            st.insert({{j,i},k});
            st.insert({{j,k},i});
            st.insert({{k,j},i});
            st.insert({{k,i},j});
        }
    }
    cout << st.size() << endl;
    for(auto p:st)cout << p.first.first <<" " << p.first.second <<" " << p.second << endl;

}