#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9;
const long long inf = 1LL<<60;
using ll = long long;

int main(){
  double a, b;
  cin >> a >> b;
  cout << fixed << setprecision(10) << b*a/100.0 << endl;
}

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define nl "\n"
#define sp " "
#define rep(i,n) for(i=0;i<n;i++)
#define repe(i,e,n) for(i=e;i<=n;i++)
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define vl vector<ll>
#define vvl vector<vl>
#define pll pair<ll,ll >
#define vpll vector<pll>
#define vvpll vector<vpll>
#define mp make_pair
#define mt make_tuple
#define len length()
#define val(n,t) get<n>(t)
#define rev(p) reverse(p.begin(),p.end())
#define all(x) x.begin(),x.end()
#define deb(x) cout<<#x<<" = "<<x<<"\n";
#define sortv(vec) sort(vec.begin(),vec.end())
#define np(str) next_permutation(str.begin(),str.end())
#define mset(a,val) memset(a,val,sizeof(a));
#define popcount(x) __builtin_popcountll(x)
#define ub(v,val) upper_bound(v.begin(),v.end(),val)
#define lb(v,val) lower_bound(v.begin(),v.end(),val)
#define np(str) next_permutation(str.begin(),str.end())
#define PI 3.14159265358979323846264338327950288419716939937510
long long int M = 1e9 + 7 ;
long long int inf = 1e18 + 7;

#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//CLOCK
ll begtime = clock();
#define time() cout << "\n\nTime elapsed: " << (clock() - begtime)*1000/CLOCKS_PER_SEC << " ms\n\n";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//CLOCK ENDED

// modular exponentiation
ll binpow(ll a, ll b) {
	ll res = 1;
	while (b > 0) {
		if (b % 2 == 1) res *= a;
		a *= a;
		b /= 2;
	}
	return res;
}
//binomial
ll modinv(ll n) {
	return binpow(n, M - 2);
}

int main() {
	IOS;
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	// ll n, m, i, j, k, l, x, y, z, t, s, tc = 1;
	double a, b;
	cin >> a >> b;
	double ans = a * (b / 100);
	cout << ans;



	return 0;


}