#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

template<class T> ostream& operator << (ostream& os, const vector<T>& vec) {
    if(vec.empty()) return os;
    os << vec[0];
    for(auto it = vec.begin(); ++it != vec.end(); ) os << ' ' << *it;
    return os;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n;
    cin >> n;
    vector<ll> a = {0, 1, n};
    vector<tuple<ll, ll, ll>> ans;
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            a = {0, i, n / i};
            do{
                ans.emplace_back(a[0], a[1], a[2]);
            }while(next_permutation(a.begin(), a.end()));
        }
    }
    for(ll a = 1; a * a <= n; a++){
        for(ll b = a; b * b <= n; b++){
            ll ng = b - 1, ok = n, mid;
            while(ng + 1 < ok){
                mid = (ng + ok) / 2;
                ll v = a * b + (a + b) * mid;
                if(v >= n) ok = mid;
                else ng = mid;
            }
            ll v = a * b + (a + b) * ok;
            if(v == n){
                vector<ll> vec = {a, b, ok};
                sort(vec.begin(), vec.end());
                do{
                    ans.emplace_back(vec[0], vec[1], vec[2]);
                }while(next_permutation(vec.begin(), vec.end()));
            }
        }
    }

    cout << ans.size() << '\n';
    for(auto &&tup : ans){
        ll a, b, c;
        tie(a, b, c) = tup;
        cout << a << ' ' << b << ' ' << c << '\n';
    }
}