A11067. 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.

The first line contains two integers $l$ and $r$ ( $2<=l<=r<=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}$ .