#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <algorithm>
#include <bitset>
#include <math.h>
#include <queue>
#include <map>
#include <set>
#include <limits.h>
#include <limits>
#include <stdio.h>
#include <stdlib.h>
#include <cstring>
#include <sstream>
using namespace std;
const int N = 1e6 + 10;
const int M = 1e4 + 5;
int siz = 0;
long long n;
long long arr[N];
int sol[M];
bool res[N];
int freq[10];
int cnt[N];

int main() 
{
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	double a, b, m=100, am;
	cin >> a >> b;
	if (a == 0 || b == 0)
	{
		cout << 0 << endl;
		return 0;
	}
	am = m / a;
	cout << b / am << endl;
	return 0;
}

// omae wa mou shindeiru
 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
#define ff              first
#define ss              second
#define float           double
#define ll              long long
#define int             long long
#define pb              push_back
#define ppb             pop_back
#define pf              push_front
#define ppf             pop_front
#define mp              make_pair
#define all(v)          v.begin(),v.end()
#define uniq(v)         (v).erase(unique(all(v)),(v).end())
#define endl            "\n"
 
#define pii             pair<int,int>
#define pll             pair<ll, ll>
#define vi              vector<int>
#define vl              vector<ll>
#define vpii            vector<pii>
#define vpll            vector<pll>
#define vvi             vector<vi>
#define vvl             vector<vl>
 
#define rep(i,a,b)      for(int i=a;i<b;i++)
#define tr(it, l)       for(auto it = l.begin(); it != l.end(); it++)
#define max(a, b)       ((a < b) ? b : a)
#define min(a, b)       ((a > b) ? b : a)
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mem1(a)         memset(a,-1,sizeof(a))
#define mem0(a)         memset(a,0,sizeof(a))
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
 
#define PI              3.1415926535897932384626433832795
#define eps             1e-9
#define mod             1000000007
#define inf             1e18
 
mt19937                 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T, typename T1>T amax(T &a, T1 b) {if (b > a)a = b; return a;}
template<typename T, typename T1>T amin(T &a, T1 b) {if (b < a)a = b; return a;}
template<typename T>
using pbds = tree<T , null_type , less<T> , rb_tree_tag , tree_order_statistics_node_update>;

 
void runtime()
{
    float a,b;
    cin >> a >> b;
    float ans = (a*b)/100;
    cout << ps(ans,8);
}
 
 
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
 
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
 
    int TESTS = 1; // one input
    // cin >> TESTS;
    while (TESTS--) {
        runtime();
        cout << "\n";
    }
    return 0;
}