http://acm.hdu.edu.cn/webcontest/contest_showproblem.php?pid=1004&ojid=1&cid=6866&hide=1&problem=Pro



#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <vector>
using namespace std;
unsigned long long INF = 4895412794951729152 ;
vector<unsigned long long>table ;
int main()
{
    int n ;
    unsigned long long i , j , k ;
    for(i = 1; i < INF; i *= 2)
        for(j = 1; j < INF; j *= 3)
          for(k = 1; k < INF; k *= 5)
             table.push_back(i *  j * k);
    sort(table.begin() , table.end());
    while(cin >> n , n){
        cout << table[n-1] << endl ;
    }
    return 0 ;
}