#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

vector<int> divisor (int a ){
	vector<int> res;
	for (int i = 1; i*i <= a; i++ ){
		if (a % i == 0 ){
			res.push_back (i);
			if (i*i < a ) res.push_back (a/i);
		} // end if
	} // end for

	sort (ALL (res ) );

	return res;
}

void disp_div (vector<int> d ){
	rep (i, d.size() ) cerr << d[i] << (i != d.size() - 1 ? ' ' : '\n' );
}

int main()
{
	ios_base::sync_with_stdio(0);
	int N, K; cin >> N >> K;

	int res = 0;
	if (N <= K ){
		res = 1;
	}else{
		vector<int> div = divisor (N );
//		disp_div (div );
		vector<int>::iterator it = lower_bound (ALL (div ), K );
		int k = *it;
		res = N/k;
	} // end if

	cout << res << endl;

	return 0;
}