CF805A.Fake NP

Tavak and Seyyed are good friends. Seyyed is very funny and he told Tavak to solve the following problem instead of longest-path.

You are given l and r. For all integers from l to r, inclusive, we wrote down all of their integer divisors except 1. Find the integer that we wrote down the maximum number of times.

Solve the problem to show that it's not a NP problem.

塔瓦克和赛义德是好朋友。赛义德非常风趣，他让塔瓦克解决下面这个问题，而不是最长路径问题。

给定整数 $l$ 和 $r$。对于所有从 $l$ 到 $r$（含端点）的整数，我们写下它们的所有大于 1 的正整数因子。找出被写下的次数最多的那个整数。

请解出该问题，以证明它不是一个 NP 问题。

The first line contains two integers l and r (2 ≤ l ≤ r ≤ 109).

第一行包含两个整数 $l$ 和 $r$（$2 \le l \le r \le 10^9$）。

Print single integer, the integer that appears maximum number of times in the divisors.

If there are multiple answers, print any of them.

输出一个整数，即在所有约数中出现次数最多的那个整数。

如果存在多个满足条件的答案，输出其中任意一个即可。

Definition of a divisor: https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html

The first example: from 19 to 29 these numbers are divisible by 2: {20, 22, 24, 26, 28}.

The second example: from 3 to 6 these numbers are divisible by 3: {3, 6}.

约数的定义：https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html

第一个例子：在 19 到 29 之间的数中，能被 2 整除的数有：{20, 22, 24, 26, 28}。

第二个例子：在 3 到 6 之间的数中，能被 3 整除的数有：{3, 6}。