class Solution {
    public int getUglyNumber(int n) {
           PriorityQueue<Long>queue=new PriorityQueue<>();
           long res=1L;

           for(int i=1;i<n;i++){
               queue.add(res*2);
               queue.add(res*3);
               queue.add(res*5);
               res=queue.poll();
               while(!queue.isEmpty()&&queue.peek()==res) queue.poll();
           }

           return (int)res;
    }
}