#include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
using lint = long long;

int main() {
    int N;
    cin >> N;

    vector<tuple<int, int, int>> ret;
    for (lint lo = 0; lo * lo * 3 <= N; ++lo) {
        for (lint med = lo; lo * med + med * med + med * lo <= N; ++med) {
            if (!med) continue;
            lint rem = N - lo * med;

            if (rem % (lo + med)) continue;

            lint hi = rem / (lo + med);

            ret.emplace_back(lo, med, hi);
            ret.emplace_back(lo, hi, med);
            ret.emplace_back(hi, med, lo);
            ret.emplace_back(hi, lo, med);
            ret.emplace_back(med, hi, lo);
            ret.emplace_back(med, lo, hi);
        }
    }
    sort(ret.begin(), ret.end());
    ret.erase(unique(ret.begin(), ret.end()), ret.end());

    cout << ret.size() << '\n';
    for (auto [x, y, z] : ret) cout << x << ' ' << y << ' ' << z << '\n';
}