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
import itertools
import math
import copy

N,M=map(int, raw_input().split())

M2=copy.deepcopy(M)

A={}

a=int( math.sqrt(M) )+2

for i in range(2,a):
	while M%i==0:
		if i not in A:
			A[i]=1
		else:
			A[i]+=1
		M/=i
else:
	A[M]=1



B=[]

for x in A.values():
	B.append( range(x+1) )


L=list(itertools.product(*B))


Y=[]	#Yakusu
for x in L:
	t=1
	for i,j in zip(A,x):
		t*=i**j
	Y.append(t)


ans=0
for cd in Y:	#cd: Common Divivor(yakusu)
	if M2/cd>=N:
		ans=max(ans,cd)

print ans

