#include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
int main()
{
  string str;
  while(getline(cin,str)){
    if(str=="\0"){
      break;
    }
    stack<double> M;
    stringstream ss(str);
    while(ss >>str){
    double a1 = 0;
    double a2 = 0;
      if(str =="+"){
	a2 =M.top();
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1+a2;
	M.push(a1);
      }else if(str =="-"){
	a2 =M.top();
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1-a2;
	M.push(a1);
      }else if(str =="*"){
	a2 =M.top();
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1*a2;
	M.push(a1);
      }else if(str =="/"){
	a2 =M.top();
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1/a2;
	M.push(a1);
      }
      else{
	double a = 0;
	double k =str.size();
	for(int i = 0;i <k;i++){
	   a += (str[i]-'0')*(pow(10.0,k-i-1));
	}
	M.push(a);
    }
  }
  printf("%.6f\n",M.top());
  }
  return 0;
}