#include <bits/stdc++.h>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr ll MOD=998244353;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;

template<typename T>
T LogOutput(T a, bool b = true){
	if(b) cout << a << endl;
	return a;
}
template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << LogOutput(args, false) << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<T>& data){
	for(int i = 0 ; i < data.size() ; ++i){
		cout << LogOutput(data[i], false) << " \n"[i == data.size() - 1];
	}
}
template<typename T>
void LogOutput(vector<vector<T>>& data){
	for(auto d : data) LogOutput(d);
}

vector<tp> ans;

void Push(int i, int j, int k){
	veci a(3);
	a[0] = i;
	a[1] = j;
	a[2] = k;
	do{
		ans.emplace_back(a[0], a[1], a[2]);
	}while(next_permutation(all(a)));
}

void solve(int n){
	for(int i = 0; i * i <= n ; ++i){
		for(int j = i; j * j <= n ; ++j){
			if(i == 0 && j == 0) continue;
			if((n - i * j) % (i + j) == 0 && j <= (n - i * j) / (i + j)){
				Push(i, j, (n - i * j) / (i + j));
			}
		}
	}
}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n;cin>>n;
	ans = vector<tp>();
	solve(n);
	cout<<ans.size()<<endl;
	for(auto [a, b, c] : ans) PrintR(a, b, c);
}