p03241 AtCoder Beginner Contest 112 - Partition
You are given integers N and M.

Consider a sequence a of length N consisting of positive integers such that a_1 + a_2 + ... + a_N = M. Find the maximum possible value of the greatest common divisor of a_1, a_2, ..., a_N.

Constraints

* All values in input are integers.
* 1 \leq N \leq 10^5
* N \leq M \leq 10^9

Input

Input is given from Standard Input in the following format:


N M


Output

Print the maximum possible value of the greatest common divisor of a sequence a_1, a_2, ..., a_N that satisfies the condition.

Examples

Input

3 14


Output

2


Input

10 123


Output

3


Input

100000 1000000000


Output

10000
```python
N ,M = map(int,input().split())
L = []
ans = 0
for i in range(1,int(M**(1/2)+1)):
    if M % i == 0:
        if i >= N: ans = max(ans,M//i)
        if M // i >= N: ans = max(ans,i)
print(ans)

```