/*****************************************
备注：
******************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int n=1;
char a[N];
double f()
{
	cin>>a;
	int len=strlen(a);
	if(len==1&&!(a[0]>='0'&&a[0]<='9'))
		switch(a[0])
		{
			case '+':
			return f() + f();
			case '-':
			return f() - f();
			case '*':
			return f() * f();
			case '/':return f() / f();
		}
	else
	{
		return atof(a);
	}
}
int main()
{
	printf("%f\n",f());
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
char a[32768];
double f(){
	cin>>a;
	if(a[0]=='*') return f()*f();
	if(a[0]=='/') return f()/f();
	if(a[0]=='+') return f()+f();
	if(a[0]=='-') return f()-f();
	return atof(a); //把字符串转换为一个double类型的浮点数
}
int main(){
	printf("%lf\n", f());
	return 0;
}
//包AC!!!

#include <stdio.h>
#include <iostream>
char a[32768];
double f()
{
	std :: cin >> a;
	if(a[0] == '*')
		return f() * f();
	if(a[0] == '/')
		return f() / f();
	if(a[0] == '+')
		return f() + f();
	if(a[0] == '-')
		return f() - f();
	return atof(a);
}
int main()
{
	printf("%lf\n", f());
	return 0;
}