#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define INF 3000000000000001 // 3e15
#define ll_max 9000000000000000000
#define PI 3.14159265358979323846L
#define fill(a, n, x) for(int i = 0; i < n; i++) a[i] = x;
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> pll;
const ll mod = 998244353;
const ll N = 100110;
const ll M = log2(N) + 1;

struct point
{
    ll x, y;
};

template<typename T>
T fast_exp(T x,T n)
{
    if(n == 0) return 1;
    T ans = 1;
    if(n % 2 == 0)
    {
         ans = fast_exp(x, n / 2);
         ans = ans * ans % mod;
    }
    else ans = fast_exp(x, n - 1) * x % mod;
    return ans;
}

void BITfunc(ll &a, ll &x)
{
    a += x;
}

void update(ll BIT[], ll i, ll x, ll n)
{
    if(i <= 0) return;
    for(; i <= n; i += i & (-i))
        BITfunc(BIT[i], x);
}

ll Query(ll BIT[], ll x)
{
    ll res = 0;
    while(x > 0)
    {
        BITfunc(res, BIT[x]);
        x = x & (x - 1);
    }
    return res;
}

ll query(ll BIT[], ll l, ll r)
{
    l--;
    ll sum = 0;
    while(r > 0)
    {
        sum += BIT[r];
        r = r & (r - 1);
    }
    while(l > 0)
    {
        sum -= BIT[l];
        l = l & (l - 1);
    }
    return sum;
}

ll fact[N], infact[N];
void work()
{
    fact[0] = fact[1] = infact[0] = infact[1] = 1;
    for(ll i = 2; i < N; i++)
    {
        fact[i] = fact[i - 1] * i % mod;
        infact[i] = fast_exp(fact[i], mod - 2);
    }
}

ll ncr(ll n, ll r)
{
    if(r > n || r < 0) return 0;
    return fact[n] * infact[n - r] % mod * infact[r] % mod;
}

ll npr(ll n, ll r)
{
    if(r > n || r < 0) return 0;
    return fact[n] * infact[n - r] % mod;
}

int main()
{
    fast;
    int _ = 1, test = 0;
    //cin >> _;
    while(_--)
    {
        test++;
        ll n, m, x, q = 0, y = 0, z = 0, ans = 0, k = 0, mx = 0;
        cin >> x >> y;
        for(int i = x; i < y; i++)
        {
            k = i;
            for(ll j = 1; j * j <= k; j++)
            {
                if(k % j == 0)
                {
                    if(k + j <= y)
                        ans = max(ans, j);
                    if(k + k / j <= y)
                        ans = max(ans, k / j);
                }
            }
        }
        cout << ans << "\n";
    }
    return 0;
}

#include<iostream>
#include <algorithm>
using namespace std;

int main(){
  float A,B;
  float ans=0;
  cin>>A>>B;
  ans=(A-B)*100/A;
  cout<<ans;
}