Fake NP

题意翻译

给定区间$[l,r]$ ,令集合$S$ 为区间$[l,r]$ 所有正整数的因子，找出一个因子$x$ ，使得区间$[l,r]$ 中整除$x$ 的数最多

题目描述

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.

输入输出样例

输入样例 #1

19 29

输出样例 #1

2

输入样例 #2

3 6

输出样例 #2

3

说明

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} $ .

题意翻译

给定区间$[l,r]$ ,令集合$S$ 为区间$[l,r]$ 所有正整数的因子，找出一个因子$x$ ，使得区间$[l,r]$ 中整除$x$ 的数最多