#include <bits/stdc++.h>
using namespace std;
int nthUglyNumber(int n) {
        priority_queue<int, vector<int>, greater<int>> p;
        p.push(1);
        int t,c=1;;
        while(c<n)
        {
        	while(t==p.top())
        	p.pop();
            t=p.top();
            p.pop();
            c++;
            p.push(t*2);
            p.push(t*3);
            p.push(t*5);
        }
        return t;
    }
int main()
{
	cout<<nthUglyNumber(10);
 
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBudGhVZ2x5TnVtYmVyKGludCBuKSB7CiAgICAgICAgcHJpb3JpdHlfcXVldWU8aW50LCB2ZWN0b3I8aW50PiwgZ3JlYXRlcjxpbnQ+PiBwOwogICAgICAgIHAucHVzaCgxKTsKICAgICAgICBpbnQgdCxjPTE7OwogICAgICAgIHdoaWxlKGM8bikKICAgICAgICB7CiAgICAgICAgCXdoaWxlKHQ9PXAudG9wKCkpCiAgICAgICAgCXAucG9wKCk7CiAgICAgICAgICAgIHQ9cC50b3AoKTsKICAgICAgICAgICAgcC5wb3AoKTsKICAgICAgICAgICAgYysrOwogICAgICAgICAgICBwLnB1c2godCoyKTsKICAgICAgICAgICAgcC5wdXNoKHQqMyk7CiAgICAgICAgICAgIHAucHVzaCh0KjUpOwogICAgICAgIH0KICAgICAgICByZXR1cm4gdDsKICAgIH0KaW50IG1haW4oKQp7Cgljb3V0PDxudGhVZ2x5TnVtYmVyKDEwKTsKCQp9