A scheduler wants the value in [L, R] that has the most divisors, because it offers the most ways to split a task evenly. Among all integers in the range, output the one with the greatest number of positive divisors. If several integers tie for the greatest divisor count, output the smallest of them.
Input format
A single line with two integers L and R.
Output format
A single integer: the value in [L, R] with the maximum divisor count (the smallest such value on a tie).
Constraints
- 1 <= L <= R <= 100000