package day1501; import java.util.ArrayList; import java.util.LinkedList; import java.util.List; im

package day1501;


import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Scanner;


public class Test1 {
public static void main(String[] args) {
System.out.println("输入n求第n个丑数");
int n = new Scanner(System.in).nextInt();


Long ugly = chouShu(n);


System.out.println(ugly);


}


private static Long chouShu(int n) {


LinkedList<Long> list3 = new LinkedList();
LinkedList<Long> list5 = new LinkedList();
LinkedList<Long> list7 = new LinkedList();


list3.add(3l);
list5.add(5l);
list7.add(7l);


long r = 0;
for (int i = 1; i <= n; i++) {
long a = list3.getFirst();
long b = list5.getFirst();
long c = list7.getFirst();


r = Math.min(a, Math.min(b, c));
if (r == a)
list3.removeFirst();
if (r == b)
list5.removeFirst();
if (r == c)
list7.removeFirst();


list3.add(3 * r);
list5.add(5 * r);
list3.add(7 * r);
}


return r;
}


private static Long x(int n) {
int c = 0;
long r = 0;
long start = System.currentTimeMillis();
for (int i = 3;; i++) {
int j = i;


while (true) {
if (j % 3 == 0) {
j = j / 3;
continue;
}
if (j % 5 == 0) {
j = j / 5;
continue;
}
if (j % 7 == 0) {
j = j / 7;
continue;
} else {
break;
}
}
/*
* while (j % 3 == 0) { j /= 3; } while (j % 5 == 0) { j /= 5; }
* 
* while (j % 7 == 0) { j /= 7; }
*/
if (j == 1) {
c++;
r = i;
if (c == n) {
return r;
}
}


}


}


}