#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;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n+1); i++)

int main() {
  int a, b;
  cin >> a >> b;

  double ans;
  ans = a * b / 100.0;
    cout << ans << endl;
  return 0;
}