#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
using namespace std;

typedef long long LL;
const int N = 3010;
const int inf = 1e7+7;
const double PI = acos(-1.0);
const double eps = 1e-6 ;

char str[N];
int top1,top2,pos,len;

bool is_digit( char s ) { if( s < ‘0‘ || s > ‘9‘ ) return false ; return true ; }

double cal( double a , char s , double b ) {
    if( s == ‘+‘ ) return a+b ;
    else if( s==‘-‘) return a-b;
    else if( s==‘*‘) return a*b ;
    else if( s==‘/‘) return a / b ;
}

double get(){
    double a , b ; char opp;
    a = 0 ; while( pos < len && is_digit( str[pos] ) ) a = a * 10 + ( str[pos] - ‘0‘ ) , pos++; pos++;
    while( pos < len && ( str[pos] == ‘*‘ || str[pos] == ‘/‘ ) ) {
        opp = str[pos] ; pos += 2 ;
        b = 0 ; while( pos < len && is_digit( str[pos] ) ) b = b * 10 + ( str[pos] - ‘0‘ ) , pos++; pos++;
        a = cal( a , opp , b );
    }
    return a ;
}

int main()
{
    #ifdef LOCAL
        freopen("in.txt","r",stdin);
    #endif // LOCAL
    ios::sync_with_stdio(false);

    while( gets(str) ) {
        if( str[0] == ‘0‘ && strlen(str) == 1 ) break ;
        double a , b  ; char opp ;
        pos = 0 ; len = strlen(str) ;
        a = get();
        while( pos < len ) {
            opp = str[pos] ; pos += 2 ;
            b = get() ;
            a = cal( a , opp , b );
        }
        printf("%.2lf\n",a );
    }
    return 0;
}