#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
    int mul2 = 2,mul3 = 3,mul5 = 5,t = 0;
    int i = 1,j = 1,k = 1;

    long result[1500 + 1] = {0};
    result[1] = 1;
    int index = 2;

    for (;index <= 1500;++index)
    {
        t = min(mul2,min(mul3,mul5));
        result[index] = t;
        if (t == mul2)
            mul2 = result[++i] * 2;
        if (t == mul3)
            mul3 = result[++j] * 3;
        if (t == mul5)
            mul5 = result[++k] * 5;
    }
    while (cin >> index,index > 0)
    {
        cout << result[index] << endl;
    }
    return 0;
}