Marinchyna's Treasure Box
Second-grader Igor has a younger sister, Marinka, who isn't very good at counting yet, so she often asks Igor to count things for her. To reduce these interruptions, Igor began teaching Marinka arithmetic. Everything was going smoothly until Marinka learned that 2, 3, and 5 are prime numbers. Marinka has a piggy bank where she collects coins of 2, 3, and 5 rubles (with 3 rubles being a very rare coin!). Now, Marinka is only interested in integers that have no prime divisors other than 2, 3, and 5. She started asking Igor to identify such numbers. Initially, Igor thought he could easily answer Marinka's questions, but he realized that for large N, it wasn't so straightforward.
Help Igor by writing a program to calculate the N-th positive integer that has no prime divisors other than 2, 3, and 5.
For those unfamiliar with the concept, a prime number is an integer that is divisible only by 1 and itself.
Input
The input file contains a single number N ≤ 12500.
Output
Output a single number - the answer to the problem.