#include <iostream>
#include <fstream>
#include <cstring>
#include<string>
#include<cstdio>
#include<cstdlib>
#define maxv 1000000000
using namespace std;

struct NOD
{
    int op;
    NOD *as,*ad;
};

int e[30],efp[30],pfp[30],p[30],i,j,n;
NOD *c;

NOD *arb(int li,int ls,int efp[30],int pfp[30])
{
    NOD* c;
    int i,j,cmin;
    cmin=pfp[ls];
    i=ls;
    for(j=ls;j>=li;j--)
        if(pfp[j]<cmin)
        {
            cmin=pfp[j];
            i=j;
        }
    c = new NOD;
    c->op=efp[i];
    if(li==ls)
    {
        c->as=0;
        c->ad=0;
    }
    else
    {
        c->as=arb(li,i-1,efp,pfp);
        c->ad=arb(i+1,ls,efp,pfp);
    }
    return c;
}

double parc(NOD *c)
{
    if(c)
    {
        double a,b;
        a=parc(c->as);
        b=parc(c->ad);
        if(c->op == maxv+3)
            return a+b;
        if(c->op == maxv+4)
            return a-b;
        if(c->op == maxv+5)
            return a*b;
        if(c->op == maxv+6)
            return a/b;
        return c->op;
    }
}

int main()
{
    char s[100];
    ifstream f("date.txt");
    f.getline(s,100);
    int nr=0;
    n=0;
    for(i=0;i<strlen(s);i++)
    {
        if(s[i]=='(' || s[i]==')' || s[i]=='+' || s[i]=='-' || s[i]=='*' || s[i]=='/')
        {
            if(nr)
            {
                e[++n]=nr;
                nr = 0;
            }
            if(s[i]=='(')
            e[++n]=maxv+1;
            if(s[i]==')')
            e[++n]=maxv+2;
            if(s[i]=='+')
            e[++n]=maxv+3;
            if(s[i]=='-')
            e[++n]=maxv+4;
            if(s[i]=='*')
            e[++n]=maxv+5;
            if(s[i]=='/')
            e[++n]=maxv+6;
        }
        else
        {
            nr=nr*10+(s[i]-'0');
        }
    }
    if(nr)
        e[++n]=nr;
    j=0;
    for(int i=1;i<=n;i++)
    {
        if(e[i]==maxv+5 || e[i]==maxv+6)
            p[i]=j+10;
        else if(e[i]==maxv+3 || e[i]==maxv+4)
            p[i]=j+1;
        else if(e[i]==maxv+1)
            j+=10;
        else if(e[i]==maxv+2)
            j-=10;
        else p[i]=j+1000;
    }
    j=1;
    for(i=1;i<=n;i++)
    if(e[i]!=maxv+1 && e[i]!=maxv+2)
    {
        efp[j]=e[i];
        pfp[j]=p[i];
        j++;
    }
    c=arb(1,j-1,efp,pfp);
    cout<<parc(c);
    return 0;
}