public static void findTheUglyNumber(int n){
		if(n==0){
			return;
		}
		int count = 0;
		int[] res = new int[n];
		int t2=0,t3=0,t5=0;
		res[count] = 1;
		while(count < n-1){
			while(res[t2] *2 <= res[count]){
				t2 ++;
			}
			while(res[t3]*3 <= res[count]){
				t3 ++;
			}
			while(res[t5]*5 <= res[count]){
				t5 ++;
			}
			int m = min(res[t2]*2,res[t3]*3,res[t5]*5);
			res[++count] = m;
		}
		System.out.println(res[n-1]);
		
	}