#include<bits/stdc++.h>

#define vi             vector<int>
#define vb             vector<bool>
#define vs             vector<string>
#define vvi            vector<vector<int>>
#define vpi            vector<pair<int,int>>
#define pb             push_back
#define mp             make_pair
#define int            long long int
#define mod            1000000007
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int>>
#define from(i,n)      for(int i=0;i<(int)n;i++)
#define from_j(i,j,n)  for(int i=j;i<(int)n;i++)
using namespace std;

int power(int n , int k) {
    if (k == 0)return 1;
    int temp = power(n, k / 2);
    temp = (temp * temp);
    if (k % 2) return (temp * n);
    return temp;
}
int fact(int x)
{
    int res = 1;
    for(int i=2;i<=x;i++)
        res = i*res;
    return res;
}

int choose(int n, int r)
{
    return fact(n)/(fact(r)*fact(n-r));
}

int gcd(int a, int b)
{
    if (min(a, b) == 0)
        return max(a, b);
    return gcd(min(a, b), max(a, b) % min(a, b));
}
 
int lcm(int a, int b)
{
    int x = gcd(a, b);
    return abs(a*b) / x;
}

void print(vi z)
{
    for(auto x:z)
        cout<<x<<endl;
   // cout<<endl;
}

void sync()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
}

vi factors(int n)
{
	vi ans;
	ans.pb(1);
	if(n == 1)
		return ans;
	for(int i = 2;i*i<=n;i++)
	{
		if(n%i == 0)
		{
			if(n/i == i)
				ans.pb(i);
			else
			{
				ans.pb(i);
				ans.pb(n/i);
			}
		}
	}
	sort(ans.begin(), ans.end());
	ans.pb(n);
	return ans;
}

void solve()
{
    int n; cin>>n;
    print(factors(n));
}

int32_t main() {
    sync();
    
    int t;
    //cin>>t;
    t = 1;
    while(t--)
    {
        solve();    
    }

    cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n"; 
    return 0;   
} 

// Jai Shree Ram
#include<bits/stdc++.h>
typedef long long int ll;
#define pb push_back
#define max2(a,b) (a>b)?a:b
#define mi2(a,b) (a<=b)?a:b
#define fori(i,n) for(ll i=0;i<(ll)n;i++)
#define ford(i,n) for(ll i=n;i>=0;i--)
#define pll pair<ll,ll>
#define MOD 998244353
#define ff first
#define ss second
using namespace std;
#define MAX_LIMIT 1000001

// ll power(ll n, ll pow)
// {
//     n %= MOD;
//     long long int res = 1;
//     while (pow)
//     {
//         if (pow % 2)
//         {
//             res = ((res % MOD) * (n % MOD)) % MOD;
//         }
//         pow /= 2;
//         n = ((n % MOD) * (n % MOD)) % MOD;
//     }
//     res %= MOD;
//     return res;
// }

// void answer(ll ans)
// {
// 	cout<<"! "<<ans<<"\n";
// 	cout.flush();
// }
// ll query(ll l,ll r)
// {
// 	cout<<"? "<<l<<" "<<r<<"\n";
// 	cout.flush();
// 	ll rem;
// 	cin>>rem;
// 	return rem;
// }

void solve()
{
	
	ll a,b;
	cin>>a>>b;
	double d=(a-b)*100.0/a;
	cout<<setprecision(18)<<(double)d<<"\n";

	
}
 
 
 
 
int main()
{
     #ifndef ONLINE_JUDGE
     freopen("input.txt","r",stdin);
     freopen("output.txt","w",stdout);
     #endif
 
 
 
 
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);



    
    ll T;
    T=1;
    //cin>>T;
    //sievefun(1000004);
    fori(_,T)
    {
        solve();
    }
    
 
 
    
 
}
