#include <iostream>
#include <cmath>

using namespace std;

bool isPrime(int n)
{
    for (int i = 2; i <= sqrt(n); i++)
    {
        if (n % i == 0)
            return false;
    }
    return true;
}

int main()
{
    int n, cur;
    cin >> n;
    // prime
    cur = n;
    while (cur++)
    {
        if (isPrime(cur))
        {
            cout << cur << " ";
            break;
        }
    }

    // ^2
    cur = 1;
    while (cur++)
    {
        if (cur * cur > n)
        {
            cout << cur * cur << " ";
            break;
        }
    }

    // ^3
    cur = 1;
    while (cur++)
    {
        if (cur * cur * cur > n)
        {
            cout << cur * cur * cur << endl;
            break;
        }
    }
}