#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <complex>
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

#define all(c) (c).begin(),(c).end()
#define pb push_back
#define mp make_pair
#define ERASE(v,i) (v).erase(remove(all(v),i),(v).end())
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(it,c) for(typeof((c).begin()) it=(c).begin();it!=(c).end();++it)
#define debug(x) cerr<<#x<<" = "<<(x)<<endl;
#define LINE cerr<<"LINE: "<<__LINE__<<endl;

inline int toInt(string s){int v;istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x){ostringstream sout;sout<<x;return sout.str();}
template<class T> void preview(T a,T b){for(T it=a;it!=b;++it)cerr<<*it<<" ";cerr<<endl;}

const int INF = 100000000;
const double PI = acos(-1.0), EPS = 1e-10;

int main() {
	for(string line; getline(cin, line);) {
		istringstream is(line);
		stack<double> s;
		for(string ch; is >> ch;) {
			if(ch == "+") {
				double a = s.top();
				s.pop();
				double b = s.top();
				s.pop();
				s.push(b + a);
			} else if(ch == "-") {
				double a = s.top();
				s.pop();
				double b = s.top();
				s.pop();
				s.push(b - a);
			} else if(ch == "*") {
				double a = s.top();
				s.pop();
				double b = s.top();
				s.pop();
				s.push(b * a);
			} else if(ch == "/") {
				double a = s.top();
				s.pop();
				double b = s.top();
				s.pop();
				s.push(b / a);
			} else {
				istringstream iss(ch);
				double t; iss >> t;
				s.push(t);
			}
		}
		printf("%.6f\n", s.top());
	}
	return 0;
}