#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int32_t;  using i64 = int64_t;  using str = string;
using u32 = uint32_t; using u64 = uint64_t; using usize = size_t;
using f64 = double_t; template <typename T> using vec = vector<T>;
#define times(n, i) for (i64 i = 0; i < (n); ++i)
#define range(n, m, i) for (i64 i = (n); i < (m); ++i)
#define upto(n, m, i) for (i64 i = (n); i <= (m); ++i)
#define downto(n, m, i) for (i64 i = (n); i >= (m); --i)
#define foreach(xs, x) for (auto &x : (xs))
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define maximum(xs) (*max_element(all(xs)))
#define minimum(xs) (*min_element(all(xs)))
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

i64 n;

i32 main()
{
    cin >> n;
    i64 tmax = n-1;
    i64 a = 1, b = 1, c = 1;
    bool x, y, z;
    while (a*b*c < n) {
        x = (n % (b*c)) == 0;
        y = (n % (a*c)) == 0;
        z = (n % (a*b)) == 0;

        if (x && (min(a, min(b, c)) == a || (!y && !z))) {
            upto(a+1, n/(b*c), i) {
                a = i;
                if (n % (a*b) == 0 || n % (a*c) == 0) {
                    break;
                }
            }
            continue;
        }
        if (y && (min(a, min(b, c)) == b || !z)) {
            upto(b+1, n/(a*c), i) {
                b = i;
                if (n % (a*b) == 0 || n % (b*c) == 0) {
                    break;
                }
            }
            continue;
        }
        if (z) {
            upto(c+1, n/(a*b), i) {
                c = i;
                if (n % (a*c) == 0 || n % (b*c) == 0) {
                    break;
                }
            }
            continue;
        }
        a = n;
        b = 1;
        c = 1;
        break;
    }

    cout << (a+b+c-3) << " " << tmax << endl;
    return 0;
}