#include <bits/stdc++.h>

using namespace std;
using ll = long long;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;

const ll INF = 1LL << 60;

template <class T>
void chmax(T& a, T b) {
    if (b > a) a = b;
}
template <class T>
void chmin(T& a, T b) {
    if (b < a) a = b;
}

template <typename T, typename S>
std::ostream& operator<<(std::ostream& os, const pair<T, S>& x) noexcept {
    return os << "(" << x.first << ", " << x.second << ")";
}

template <typename T>
void print_vector(vector<T> a) {
    cout << '[';
    for (int i = 0; i < a.size(); i++) {
        cout << a[i];
        if (i != a.size() - 1) {
            cout << ", ";
        }
    }
    cout << ']' << endl;
}

struct triple {
    ll first, second, third;
    bool operator<(const triple& other) const {
        if (first != other.first) return first < other.first;
        if (second != other.second) return second < other.second;
        return third < other.third;
    }
};

void solve() {
    ll N;
    cin >> N;
    ll M = int(sqrt((double)N / (double)3)) + 10;
    // std::cout << M << "\n";
    vector<vector<ll>> tmp;
    for (ll x = 0; x <= M; x++) {
        ll y = x;
        while (true) {
            if (x == 0 && y == 0) {
                y++;
                continue;
            }
            if (N - x * y < 0 || (x == 0 && y > N)) break;
            if ((N - x * y) % (x + y) != 0) {
                y++;
                continue;
            }
            ll z = (N - x * y) / (x + y);
            // std::cout << x << ' ' << y << ' ' << z << "\n";
            vector<ll> vec;
            vec.push_back(x);
            vec.push_back(y);
            vec.push_back(z);
            tmp.push_back(vec);
            y++;
        }
    }
    set<vector<ll>> rets;
    for (auto& v : tmp) {
        vector<int> indices;
        for (int i = 0; i < 3; i++) {
            indices.push_back(i);
        }
        do {
            vector<ll> u;
            for (int i = 0; i < 3; i++) {
                u.push_back(v[indices[i]]);
            }
            rets.insert(u);
        } while (next_permutation(indices.begin(), indices.end()));
    }
    std::cout << rets.size() << "\n";
    for (auto& v : rets) {
        for (auto& u : v) {
            std::cout << u << " ";
        }
        std::cout << "\n";
    }
}

int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}