#include using namespace std; #include using namespace atcoder; using ll = long long; using vll = vector; using vvll = vector; using vvvll = vector; using vvvvll = vector; using vvvvvll = vector; #define all(A) A.begin(),A.end() #define rep(i, n) for (ll i = 0; i < (ll) (n); i++) template bool chmax(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p < q) { p = q; return 1; } else { return 0; } } template bool chmin(T& p, T q, bool C = 1) { if (C == 0 && p == q) { return 1; } if (p > q) { p = q; return 1; } else { return 0; } } ll gcd(ll(a), ll(b)) { if (a == 0)return b; if (b == 0)return a; ll c = a; while (a % b != 0) { c = a % b; a = b; b = c; } return b; } ll sqrtz(ll N) { ll L = 0; ll R = sqrt(N) + 10000; while (abs(R - L) > 1) { ll mid = (R + L) / 2; if (mid * mid <= N)L = mid; else R = mid; } return L; } ll inva(ll N, ll M) { ll mod = M; ll a = N, b = mod, c = 1, d = 0; while (b > 0) { ll t = a / b; a -= t * b; swap(a, b); c -= t * d; swap(c, d); } c %= mod; if (c < 0)c += mod; return c; } ll modPow(long long a, long long n, long long p) { if (n == 0) return 1; // 0乗にも対応する場合 if (n == 1) return a % p; if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p; long long t = modPow(a, n / 2, p); return (t * t) % p; } struct box{ ll up,down; }; int main() { cin.tie(nullptr); ios::sync_with_stdio(false); ll N; cin>>N; set> AN; for(ll x=0;x*x<=N;x++){ for(ll y=x;y*y<=N;y++){ if(x+y==0)continue; if(N-x*y<0)continue; if((N-x*y)%(x+y)!=0)continue; ll z=(N-x*y)/(x+y); AN.insert({x,y,z}); AN.insert({x,z,y}); AN.insert({y,z,x}); AN.insert({y,x,z}); AN.insert({z,y,x}); AN.insert({z,x,y}); } } cout<(a)<<" "<(a)<<" "<(a)<