#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};
stack<double> M;
int main()
{
  char n;
  
  while(cin >>n){
    double a1 = 0;
    double a2 = 0;
      if(n =='+'){
	a2 =M.top();
	cout <<a2<<endl;
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1+a2;
	M.push(a1);
      }else if(n =='-'){
	a2 =M.top();
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1-a2;
	M.push(a1);
      }else if(n =='*'){
	a2 =M.top();
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1*a2;
	M.push(a1);
      }else if(n =='/'){
	a2 =M.top();
	M.pop();
	a1 =M.top();
	M.pop();
	a1 =a1/a2;
	M.push(a1);
      }
      else{
      double x;
      x =n -'0';
      M.push(x);
    }
  }
  printf("%.6f\n",M.top());
  M.pop();
  return 0;
}