PROGRAMMING:Kth of 1235 Gang
Integers 1,2,3,5 form a guild: only natural numbers obtained by internal multiplication of 1,2,3,5 can join the guild (that is, they can be written in the form of the product of a power of 2, a power of 3 and a power of 5). For example, 60 = 4x15 = $$2 ^ 2 $$x3x5, so 60 is 1234). From small to large, the top ten members are: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12. Please write a program to output the k-th integer (the first is 1, the sixth is 6, and the tenth is 12).
Because K may get a larger value, please try to use an efficient algorithm.
###Input format:
Enter a rank number (1 -- N)
###Output format:
Direct output of the k-th member.
###Input example:
```in
twelve
```
###Output example:
```out
sixteen
```
answer：If there is no answer, please comment
Because K may get a larger value, please try to use an efficient algorithm.
###Input format:
Enter a rank number (1 -- N)
###Output format:
Direct output of the k-th member.
###Input example:
```in
twelve
```
###Output example:
```out
sixteen
```
answer：If there is no answer, please comment