#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<array<int, 3>>v;
	for (int i = 0; i * i *i <= n; ++i) {
		for (int j = i; i * j + (i + j)*j <= n; ++j) {
			if (0 == i + j)continue;
			if (0 != (n - i * j) % (i + j))continue;
			int k = (n - i * j) / (i + j);
			v.push_back({ i,j,k });
			v.push_back({ i,k,j });
			v.push_back({ j,i,k });
			v.push_back({ j,k,i });
			v.push_back({ k,i,j });
			v.push_back({ k,j,i });
		}
	}
	sort(all(v));
	v.erase(unique(all(v)), v.end());
	cout << v.size() << endl;
	rep(i, v.size())cout << v[i][0] << " " << v[i][1] << " " << v[i][2] << endl;;
	return 0;
}