using System;
using System.IO;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;
using System.Collections.Generic;
using System.Diagnostics;
using System.Numerics;
using Enu = System.Linq.Enumerable;

public class Program
{
    long ans;
    long[] primes;
    int[] num;
    long[] mult = { 1, 1, 1 };

    public void Solve()
    {
        long N = Reader.Long();
        ans = N - 1;
        var factors = Factorization(N);
        primes = factors.Keys.ToArray();
        num = factors.Values.ToArray();
        Rec(0, 0);
        Console.WriteLine(ans + " " + (N - 1));
        Console.ReadLine();
    }

    void Rec(int who, long sum)
    {
        if (who == 2)
        {
            long mult = 1;
            for (int i = 0; i < primes.Length; i++)
                for (int c = 0; c < num[i]; c++)
                    mult *= primes[i];
            sum += mult - 1;
            if (sum < ans) ans = sum;
            return;
        }
        var cand = new List<int[]>();
        Select(0, new int[primes.Length], cand);
        foreach (var c in cand)
        {
            long mult = 1;
            for (int i = 0; i < primes.Length; i++)
            {
                num[i] -= c[i];
                for (int t = 0; t < c[i]; t++) mult *= primes[i];
            }
            Rec(who + 1, sum + mult - 1);
            for (int i = 0; i < primes.Length; i++)
                num[i] += c[i];
        }
    }

    void Select(int i, int[] curr, List<int[]> cand)
    {
        if (i == primes.Length)
        {
            int[] copy = new int[curr.Length];
            Array.Copy(curr, copy, curr.Length);
            cand.Add(copy);
            return;
        }
        for (int c = 0; c <= num[i]; c++)
        {
            curr[i] = c;
            Select(i + 1, curr, cand);
        }
    }


    static Dictionary<long, int> Factorization(long n)
    {
        var dic = new Dictionary<long, int>();
        for (long i = 2; i * i <= n; i++)
            while (n % i == 0)
            {
                n /= i;
                if (!dic.ContainsKey(i)) dic[i] = 1;
                else dic[i]++;
            }
        if (n > 1) dic[n] = 1;
        return dic;
    }
}


class Entry { static void Main() { new Program().Solve(); } }
class Reader
{
    static TextReader reader = Console.In;
    static readonly char[] separator = { ' ' };
    static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries;
    static string[] A = new string[0];
    static int i;
    static void Init() { A = new string[0]; }
    public static void Set(TextReader r) { reader = r; Init(); }
    public static void Set(string file) { reader = new StreamReader(file); Init(); }
    public static bool HasNext() { return CheckNext(); }
    public static string String() { return Next(); }
    public static int Int() { return int.Parse(Next()); }
    public static long Long() { return long.Parse(Next()); }
    public static double Double() { return double.Parse(Next()); }
    public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); }
    public static int[] IntArray(int N) { return Range(N, Int); }
    public static int[][] IntTable(int H) { return Range(H, IntLine); }
    public static string[] StringArray(int N) { return Range(N, Next); }
    public static string[][] StringTable(int N) { return Range(N, () => Split(Line())); }
    public static string Line() { return reader.ReadLine().Trim(); }
    static T[] Range<T>(int N, Func<T> f) { return Enu.Range(0, N).Select(i => f()).ToArray(); }
    static string[] Split(string s) { return s.Split(separator, op); }
    static string Next() { CheckNext(); return A[i++]; }
    static bool CheckNext()
    {
        if (i < A.Length) return true;
        string line = reader.ReadLine();
        if (line == null) return false;
        if (line == "") return CheckNext();
        A = Split(line);
        i = 0;
        return true;
    }
}