#include <iostream>
#include <string>
#include <iomanip>
#include <vector>
#include <algorithm>
using namespace std;

int main()
{
    /*int64_t n;
    cin >> n;

    vector<int64_t> v(n * n);

    for (int64_t i = 0; i < (n * n); i++)
    {
        cin >> v[i];
    }

    sort(v.begin(), v.end());

    int mx = v[v.size() - 1];

    for (int i = 1; i <= mx; i++)
    {
        cout << i << " ";
    }*/

    int i, j;
    cin >> i >> j;

    vector<int> v(0);
    vector<int> ch(0);

    for (; i <= j; i++)
    {
        int cur = i;
        double sum = 0;
        int jii = sqrt(cur);
        for (int dev = 2; dev < sqrt(cur); dev++)
        {

            if (cur % dev == 0)
            {
                //cout << dev << " ";
                sum += dev;

                sum += cur / dev;
                //cout << cur / dev << "  ";
            }
        }

        sum += jii;
        sum += 1;

        double k = (sum / i) + 0.0;

        //cout << "            " << sum << " " << i << " " << k << endl;

        ch.push_back(i);
        v.push_back(k);
    }

    int min = 1000000000;
    int mind;
    for (int x = 0; x < v.size(); x++)
    {
        if (v[x] < min)
        {
            min = v[x];
            mind = x;
        }
    }
    cout << ch[mind];
}