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<sup class="upper-index">9</sup>).
Definition of a divisor: [https://www.mathsisfun.com/definitions/divisor-of-an-integer-.html](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}.
19 29
2
3 6
2
39 91
2
76 134
2
93 95
2
17 35
2
94 95
2
51 52
2
47 52
2
38 98
2
30 37
2
56 92
2
900000000 1000000000
2
37622224 162971117
2
760632746 850720703
2
908580370 968054552
2
951594860 953554446
2
347877978 913527175
2
620769961 988145114
2
820844234 892579936
2
741254764 741254768
2
80270976 80270977
2
392602363 392602367
2
519002744 519002744
519002744
331900277 331900277
331900277
419873015 419873018
2
349533413 349533413
349533413
28829775 28829776
2
568814539 568814539
568814539
720270740 720270743
2
871232720 871232722
2
305693653 305693653
305693653
634097178 634097179
2
450868287 450868290
2
252662256 252662260
2
575062045 575062049
2
273072892 273072894
2
770439256 770439256
770439256
2 1000000000
2
6 8
2
2 879190747
2
5 5
5
999999937 999999937
999999937
3 3
3
5 100
2
2 2
2
3 18
2
7 7
7
39916801 39916801
39916801
3 8
2
13 13
13
4 8
2
3 12
2
6 12
2
999999103 999999103
999999103
100000007 100000007
100000007
3 99
2
999999733 999999733
999999733
5 10
2
982451653 982451653
982451653
999900001 1000000000
2
999727999 999727999
999727999
2 999999999
2
242 244
2
3 10
2
15 27
2
998244353 998244353
998244353
5 15
2
999999797 999999797
999999797
2 3
2
999999929 999999929
999999929
3 111111
2
12 18
2
479001599 479001599
479001599
10000019 10000019
10000019
715827883 715827883
715827883
999992977 999992977
999992977
11 11
11
29 29
29
1000003 1000003
1000003
6 15
2
1200007 1200007
1200007
3 1000000000
2
990000023 990000023
990000023
1717 1717
1717
141650963 141650963
141650963
1002523 1002523
1002523
900000011 900000011
900000011
104729 104729
104729
4 12
2
100003 100003
100003
17 17
17
10 100
2
from math import ceil as c
x,y=map(int,input().split())
if x-y==0:
	print(x)
elif x-y==1:
	print(2)
else:
	two=c((abs(x-y))/2)+min([(x+1)%2,(y+1)%2])
	three=abs(x-y+1)//3
	if x%3==0 or y%3==0:three+=1
	print(2 if two>=three else 3)