Cacher is the code snippet organizer for pro developers

/*
http://ideone.com/k6TrUn
http://www.geeksforgeeks.org/ugly-numbers/
http://www.practice.geeksforgeeks.org/problem-page.php?pid=553
*/

#include <iostream>
#include <string>
#include <vector>
using namespace std; 

int maxDivide(int a, int b){
	while(a % b == 0)
		a /= b;
	return a;
}
bool isUgly(int num){
	num = maxDivide(num, 2);
	num = maxDivide(num, 3);
	num = maxDivide(num, 5);
	
	return (num == 1) ? true : false;
}
int countUgly(int n){
	int i=1, count = 1;
	while(count < n){
		i++;
		if(isUgly(i))
			count++;
	}
	return i;
}
int main() {
	int t, n;
	cin >> t;
	while(t--){
		cin >> n;
		cout << countUgly(n) <<endl;
	}
	return 0;
}