/**/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <stack>
#include <queue>

typedef long long LL;
using namespace std;

double n;

int main()
{
	//freopen("in.txt", "r", stdin);
	//freopen("out.txt", "w", stdout);

	while(scanf("%lf", &n) == 1){
		char c;
		c = getchar();
		stack<double>st;
		st.push(n);
		if(c == '\n' && n == 0){
			break;
		}
		c = getchar();
		while(scanf("%lf", &n) == 1){
			if(c == '*'){
				double u = st.top();
				st.pop();
				st.push(u * n);
			}else if(c == '/'){
				double u = st.top();
				st.pop();
				st.push(u / n);
			}else if(c == '-'){
				st.push(-n);
			}else{
				st.push(n);
			}
			if(getchar() == '\n') break;
			c = getchar();
		}
		double ans = 0;
		while(st.size()){
			ans += st.top();
			st.pop();
		}
		printf("%.2lf\n", ans);
	}

	return 0;
}
/**/