Beautiful Number

Beautiful Number

时间： 1ms        内存：64M

描述：

Mike is very lucky, as he has two beautiful numbers, 3 and 5. But he is so greedy that he wants infinite beautiful numbers. So he declares that any positive number which is dividable by 3 or 5 is beautiful number. Given you an integer N (1 <= N <= 100000), could you please tell mike the Nth beautiful number?

输入：

The input consists of one or more test cases. For each test case, there is a single line containing an integer N.

输出：

For each test case in the input, output the result on a line by itself.

示例输入：

1
2
3
4

示例输出：

3
5
6
9

提示：

参考答案：

解锁文章

没有看到答案？微信扫描二维码可免费解锁文章

使用微信扫描二维码打开广告页面后可以立即关闭，再刷新此页面即可正常浏览此文章

所跳转广告均由第三方提供，并不代表本站观点！

已经扫描此二维码？点此立即跳转

文章解锁成功，即将自动跳转，点此立即跳转