#include <iostream>

#include <vector>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

#include <map>

#include <set>

#include <string>

#include <queue>

#include <stack>

#include <bitset>

using namespace std;

#define pb(x) push_back(x)

#define ll long long

#define mk(x, y) make_pair(x, y)

#define lson l, m, rt<<1

#define mem(a) memset(a, 0, sizeof(a))

#define rson m+1, r, rt<<1|1

#define mem1(a) memset(a, -1, sizeof(a))

#define mem2(a) memset(a, 0x3f, sizeof(a))

#define rep(i, n, a) for(int i = a; i<n; i++)

#define fi first

#define se second

typedef pair<int, int> pll;

const double PI = acos(-1.0);

const double eps = 1e-;

const int mod = 1e9+;

const int inf = ;

const int dir[][] = { {-, }, {, }, {, -}, {, } };

int n, f[], prime[], cnt;

ll ans = 1e18+;

void dfs(int pos, int num, ll val) {

    if(pos>)

        return ;

    if(num>n)

        return ;

    if(num == n) {

        ans = min(ans, val);

        return ;

    }

    for(int i = ; i<=; i++) {

        val *= prime[pos];

        if(val>ans)

            break;

        dfs(pos+, num*(i+), val);

    }

}

int main()

{

    cin>>n;

    for(int i = ; i<; i++) {

        if(!f[i]) {

            for(int j = i+i; j<; j+=i) {

                f[j] = ;

            }

            prime[cnt++] = i;

        }

    }

    dfs(, , );

    cout<<ans<<endl;

    return ;

}