#include <iostream>
#include <stack> 
using namespace std;
char str[200];//保存表達(dá)式字符串 
int mat[][5]={//設(shè)置優(yōu)先級(jí)1表示優(yōu)先級(jí)較大，0表示較小 
 1,0,0,0,0,
 1,0,0,0,0,
 1,0,0,0,0,
 1,1,1,0,0,
 1,1,1,0,0,
 
};
stack<int> op;//運(yùn)算符棧 
stack<double> in;//數(shù)字棧 
void getOp(bool &reto,int &retn,int &i){
 if(i==0&&op.empty()==true){
 reto=true;
 retn=0;
 return;
 }
 if(str[i]==0){
 reto=true;
 retn=0;
 return; 
 } 
 if(str[i]>='0'&&str[i]<='9'){
 reto=false;
 }else{
 reto=true;
 if(str[i]=='+'){
  retn=1;
 }else if(str[i]=='-'){
  retn=2;
 }else if(str[i]=='*'){
  retn=3;
 }
 else if(str[i]=='/'){
  retn=4;
 }
 i+=2;
 return;
 }
 retn=0;
 for(;str[i]!=' '&&str[i]!=0;i++){
 retn*=10;
 retn+=str[i]-'0'; 
 }
 if(str[i]==' '){
 i++;
 }
 return;
} 
int main(int argc, char *argv[])
{
 while(gets(str)){
 if(str[0]=='0'&&str[1]==0) break;
 bool retop;int retnum;
 int idx=0;
 while(!op.empty()) op.pop();
 while(!in.empty()) in.pop();
 while(true){
  getOp(retop,retnum,idx);
  if(retop==false){
  in.push((double)retnum);
  }
  else {
  double tmp;
  if(op.empty()==true||mat[retnum][op.top()]==1){
   op.push(retnum);
  }
  else{
   while(mat[retnum][op.top()]==0){
   int ret=op.top();
   op.pop();
   double b=in.top();
   in.pop();
   double a=in.top();
   in.pop();
   if(ret==1) tmp=a+b;
   else if(ret==2) tmp=a-b;
   else if(ret==3) tmp=a*b;
   else tmp=a/b;
   in.push(tmp);
   }
   op.push(retnum);
  }
  }
  if(op.size()==2&&op.top()==0) break;
 }
 printf("%.2f\n",in.top());
 }
 return 0;
}