(DP) poj 1338

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
using namespace std;
int n,ans[1505];
int main()
{
    ans[1]=1;
    int p1=1,p2=1,p3=1;
    for(int i=2;i<=1500;i++)
    {
        ans[i]=min(ans[p1]*2,min(ans[p2]*3,ans[p3]*5));
        if(ans[i]==ans[p1]*2) p1++;
        if(ans[i]==ans[p2]*3) p2++;
        if(ans[i]==ans[p3]*5) p3++;
    }
    while(scanf("%d",&n)!=EOF)
    {
        if(n==0)
            break;
        printf("%d\n",ans[n]);
    }
    return 0;
}