#include #define INIT std::ios::sync_with_stdio(false);std::cin.tie(0); // VAR(int, x); #define VAR(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__); template void Scan(T& t){std::cin >> t;} templatevoid Scan(First& first,Rest&...rest){std::cin>>first;Scan(rest...);} #define OUT(d) std::cout<<(d); #define FOUT(n, d) std::cout< c(n);for(auto& i:c)std::cin>>i; #define MAT(type, c, m, n) std::vector> c(m, std::vector(n));for(auto& r:c)for(auto& i:r)std::cin>>i; #define ALL(a) (a).begin(),(a).end() #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i) #define REP(i, n) for(int i=0;i<(n);++i) #define RREP(i, n) for(int i=(n)-1;i>=0;--i) #define PAIR std::pair #define IN(a0, y, a1, b0, x, b1) (a0<=y && y PrimeFact(ll n){ std::priority_queue result; double sqrtn = std::sqrt(n); for(ll i=2; i<=sqrtn; ++i){ int divCount = 0; if(n%i == 0){ do{ ++divCount; n/=i; result.push(i); }while(n%i == 0); } } if(n!=1){ result.push(n); } return result; } signed main(){ INIT; VAR(ll, n); auto p = PrimeFact(n); while(p.size()>3){ ll t = p.top(); p.pop(); t *= p.top(); p.pop(); p.push(t); } while(p.size()<3) p.push(1); ll t1 = p.top(); p.pop(); ll t2 = p.top(); p.pop(); ll t3 = p.top(); p.pop(); OUT(t1+t2+t3-3)SP OUT(n-1)BR; return 0; }