1261. More Divisors

单点时限: 2.0 sec

内存限制: 256 MB

Everybody knows that we use decimal notation, i.e. the base of our notation is 10. Historians say that it is so because men have ten fingers. Maybe they are right. However, this is often not very convenient, ten has only four divisors – 1, 2, 5 and 10. Thus, fractions like 1/3, 1/4 or 1/6 have inconvenient decimal representation. In this sense the notation with base 12, 24, or even 60 would be much more convenient.

The main reason for it is that the number of divisors of these numbers is much greater – 6, 8 and 12 respectively. A good quiestion is: what is the number not exceeding n that has the greatest possible number of divisors? This is the question you have to answer.

输入格式

The input consists of several test cases, each test case contains a integer n (1 <= n <= 10^16).

输出格式

For each test case, output positive integer number that does not exceed n and has the greatest possible number of divisors in a line. If there are several such numbers, output the smallest one.

样例

Input
10
20
100
Output
6
12
60

1 人解决,6 人已尝试。

1 份提交通过,共有 16 份提交。

9.9 EMB 奖励。

创建: 13 年,2 月前.

修改: 3 年前.

最后提交: 8 年,1 月前.

来源: Andrew Stankevich

题目标签