#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <ctime>
using namespace std;
 
#define rep(i,a,n) for(int i=a; i<n; i++)
#define repr(i,a,n) for(int i=a; i>=n; i--)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 999999999
 
#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
 
typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long int ll;
 
typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;
 
int dy[]={0, 0, 1, -1};
int dx[]={1, -1, 0, 0};
int const MOD = 1000000007;
 
namespace std {
    bool operator<(const P a, const P b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}
 
int main() {
    string s;
    while(getline(cin, s)){
        stack<double> part;
        stringstream ss(s);
        string temp;
        double a, b;
        while(ss >> temp) {
            if(temp == "+") {
                b = part.top(); part.pop();
                a = part.top(); part.pop();
                part.push(a + b);
            }
            else if(temp == "-") {
                b = part.top(); part.pop();
                a = part.top(); part.pop();
                part.push(a - b);
            }
            else if(temp == "*") {
                b = part.top(); part.pop();
                a = part.top(); part.pop();
                part.push(a * b);
            }
            else if(temp == "/") {
                b = part.top(); part.pop();
                a = part.top(); part.pop();
                part.push(a / b);
            }
            else part.push(atof(temp.c_str()));
        }
        printf("%.7f\n",part.top());
    }
    return 0;
}