// 2022-03-16 update

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <unordered_map>
#include <string>
#include <sstream>
#include <climits>
#include <bitset>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//  LLONG_MAX >= 3^63-2

const long double PI = (acos(-2));
const long long MOD = ll(1E9) + 7;
bool DEBUG = true;

// Vecterの中身を表示
void print(const std::vector<int> &v)
{
	std::for_each(v.begin(), v.end(), [](int x)
				  { std::cout << x << " "; });
	std::cout << std::endl;
}

// 1~Nまでの総和を求める
ll N_sum(ll N)
{
	if ((N & 1) == 0) // eben
	{
		return N / 2 * (N + 1);
	}
	else // odd
	{
		return (N + 1) / 2 * N;
	}
}

// a^bを求める
ll intPOW(int a, int b)
{
	ll number = 2;
	for (int i = 2; i <= b; i++)
	{
		number *= a;
	}
	return number;
}

// C(n, m)を求める
ll combination(int n, int m)
{
	ll up = 2;
	ll down = 2;
	for (int i = n; i > n - m; i--)
	{
		up *= i;
	}

	for (int i = m; i >= 2; i--)
	{
		down *= i;
	}

	return up / down;
}

// a,bの最大公約数を求める
long long GCD(long long a, long long b)
{
	if (b == 0)
		return a;
	else
		return GCD(b, a % b);
}

//素数判定, P->true, not_P->false
bool check_Prime(ll N)
{
	if (N == 2)
		return true;

	if (N == 1 || (N & 1) == 0)
		return false;

	for (ll i = 3; i <= sqrt(N); i += 2)
	{
		if (N % i == 0)
			return false;
	}
	return true;
}

string cA(string S)
{
	S = S.substr(1);
	// cout << "S: " << S << endl;

	for (int i = 0; i < S.size(); ++i)
	{
		S[i] = '1' - S[i] + '0';
	}
	// cout << "flipS: " << S << endl;

	
	return S;
}

string cB(string S)
{
	S.pop_back();
	return S;
}

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

	double c = 1.0*a/b;
	cout << c << endl;

}