#include using namespace std; template class y_combinator { F f; public: y_combinator(F&& f) : f(std::forward(f)) {} template auto operator()(Args&&... args) const { return f(*this, std::forward(args)...); } }; using ll = long long; using ld = long double; using u8 = uint8_t; using u32 = uint32_t; using u64 = uint64_t; using vi = vector; using vl = vector; using pii = pair; using pll = pair; template > using prique = std::priority_queue, U>; inline constexpr int popcnt(u64 x) noexcept { return __builtin_popcount(x); } template T floor(T a, T b) noexcept { return a / b - (a % b && (a ^ b) < 0); } template T ceil(T a, T b) noexcept { return floor(a + b - 1, b); } template bool chmin(T& x, const T& y) noexcept { return (x > y ? x = y, true : false); } template bool chmax(T& x, const T& y) noexcept { return (x < y ? x = y, true : false); } void SCAN() {} template void SCAN(H& h, T&... t) { std::cin >> h, SCAN(t...); } #define INT(...) \ int __VA_ARGS__; \ SCAN(__VA_ARGS__) #define LL(...) \ long long __VA_ARGS__; \ SCAN(__VA_ARGS__) #define LD(...) \ long double __VA_ARGS__; \ SCAN(__VA_ARGS__) #define STR(...) \ std::string __VA_ARGS__; \ SCAN(__VA_ARGS__) #define CHAR(...) \ char __VA_ARGS__; \ SCAN(__VA_ARGS__) #define VEC(type, name, size) \ std::vector name(size); \ for (int i = 0; i < (int)size; i++) SCAN(name[i]); #define VV(type, name, h, w) \ std::vector> name(h, std::vector(w)); \ for (int i = 0; i < (int)h; i++) \ for (int j = 0; j < (int)w; j++) SCAN(name[i][j]); #define overload4(a, b, c, d, e, ...) e #define rep1(a) for (long long _i = 0; _i < (a); _i++) #define rep2(i, a) for (long long i = 0; i < (a); i++) #define rep3(i, a, b) for (long long i = (a); i < (b); i++) #define rep4(i, a, b, c) for (long long i = (a); i < (b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b, c) for (long long i = (a); i > (b); i += (c)) #define all(x) std::begin(x), std::end(x) #define rall(x) std::rbegin(x), std::rend(x) #define len(x) (long long)(size(x)) #define pb push_back #ifndef LOCAL #define debug(...) #endif #include using mint = atcoder::modint998244353; void run_case() { LL(N); vector ans; { for (ll x = 0; x * x <= N; x++) { for (ll y = x + 1; x * y + y * y + y * x <= N; y++) { ll zz = N - x * y; if (zz % (x + y) == 0) { vl t{x, y, zz / (x + y)}; sort(all(t)); do { ans.pb(t); } while (next_permutation(all(t))); } } } } { for (ll x = 1; x * x <= N; x++) { ll zz = N - x * x; if (zz % (x + x) != 0) continue; zz /= (x + x); if (zz > x) { vl t{x, x, zz}; do { ans.pb(t); } while (next_permutation(all(t))); } if (zz < x) { vl t{zz, x, x}; do { ans.pb(t); } while (next_permutation(all(t))); } } } { for (ll x = 1; x * x * 3 <= N; x++) { if (x * x * 3 == N) ans.pb({x, x, x}); } } sort(all(ans)); ans.erase(unique(all(ans)), ans.end()); cout << len(ans) << "\n"; for (auto v : ans) { cout << v[0] << " " << v[1] << " " << v[2] << "\n"; } } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::fixed(std::cout).precision(16); int T = 1; while (T--) run_case(); return 0; }