#include<queue>
#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define N 100000
#define LL long long
using namespace std;
int w[4]={2,3,5,7};
LL n,m,nx,sum,ans,a[N];
const long long int maxn=pow(2,64)-1;
priority_queue<LL,vector<LL>,greater<LL> >q;
LL read()
{
    LL x=0,f=1; char ch=getchar();
    while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
    while(ch>=‘0‘&&ch<=‘9‘) x=x*10+ch-‘0‘,ch=getchar();
    return x*f;
}
int main()
{
    n=read(),q.push(1);
    while(!q.empty())
    {
        int x=q.top();q.pop();
        if(x!=a[sum]) sum++,a[sum]=x;
        if(sum>=n) 
        {
            ans=x;
            break;
        }
        for(int i=0;i<4;i++)
        {
            nx=x*w[i];
            if(nx>maxn) break;
            q.push(nx);
        } 
    }
    printf("%lld",ans);
    return  0;
}