#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

template<class myType>
struct Stack{
    myType data[500];
    int size;

    Stack(){
        size = 0;
        for(int i=0; i<500; i++){
            data[i] = 0;
        }
    }

    void push(myType i){
        data[size++] = i;
    }

    void pop(){
        data[size--] = 0;
    }

    long long top(){
        return data[size-1];
    }

    bool empty(){
        return size==0;
    }
};

typedef long long ll;

Stack<int> inFixToPostFix(string str){
    Stack<int> ans;

    int n = (int)str.size();

    Stack<int> stk;

    for(int i=0; i<n; i++){
        if(isdigit(str[i])){
            int _tmp = 0;
            while(1){
                _tmp = _tmp * 10 + str[i] - '0';
                if(i+1 == n || !isdigit(str[i+1])) break;
                i++;
            }
            ans.push(-_tmp);
            continue;
        }
        switch(str[i]){
        case '(':
            stk.push(str[i]);
            break;
        case ')':
            while(!stk.empty() && stk.top() != '('){
                ans.push(stk.top());
                stk.pop();
            }
            stk.pop();
            break;
        case '+':
        case '-':
            while(!stk.empty() && stk.top() != '('){
                ans.push(stk.top());
                stk.pop();
            }
            stk.push(str[i]);
            break;
        case '*':
        case '/':
            while(!stk.empty() && stk.top() != '(' &&
                  stk.top() != '+' && stk.top() != '-'){
                ans.push(stk.top());
                stk.pop();
            }
            stk.push(str[i]);
            break;
        default:
            printf("ERROR");
        }
    }
    while(!stk.empty()){
        ans.push(stk.top());
        stk.pop();
    }
    return ans;
}

double calculate(Stack<int> str){
    int n = str.size;

    Stack<double> stk;
    ll _tmp;
    ll _tmp2;

    for(int i=0; i<n; i++){
        if(str.data[i] <= 0){
            stk.push((double)-str.data[i]);
        }
        else{
            _tmp = stk.top();
            stk.pop();
            _tmp2 = stk.top();
            stk.pop();
            switch(str.data[i]){
            case '+':
                stk.push((double)(_tmp2 + _tmp));
                break;
            case '-':
                stk.push((double)(_tmp2 - _tmp));
                break;
            case '*':
                stk.push((double)(_tmp2 * _tmp));
                break;
            case '/':
                if(abs(_tmp) < 1e-6) return 0;
                stk.push((double)(_tmp2 / _tmp));
                break;
            default:
                printf("ERROR");
            }
        }
    }
    return stk.top();
}

string numbers[] = {
    "14555", "15455", "15545", "15554",
    "41555", "51455", "51545", "51554",
    "45155", "54155", "55145", "55154",
    "45515", "54515", "55415", "55514",
    "45551", "54551", "55451", "55541"
};

char oper[] = {
    '+', '-', '*', '/'
};

string brackets[] = {
      "NONONONON", "(NON)ONONON", "(NONON)ONON", "(NONONON)ON", "NO(NON)ONON",
    "NO(NONON)ON", "NO(NONONON)", "NONO(NON)ON", "NONO(NONON)", "NONONON(ON)",
    "((NONON)ON)ON", "((NON)ONON)ON", "(NO(NONON))ON", "(NO(NON)ON)ON",
    "(NONO(NON))ON", "((NON)ON)ONON", "(NO(NON))ONON", "(NONON)O(NON)",
    "(NON)O(NONON)", "(NON)O(NON)ON", "(NON)ONO(NON)",
    "NO((NONON)ON)", "NO((NON)ONON)", "NO(NO(NONON))", "NO(NO(NON)ON)", "NO(NONO(NON))",
    "NO((NON)ON)ON", "NO(NO(NON))ON", "NO(NON)O(NON)", "NONO((NON)ON)",
    "(((NON)ON)ON)ON", "((NO(NON))ON)ON", "((NON)O(NON))ON",
    "((NON)ON)O(NON)", "(NO((NON)ON))ON", "(NO(NO(NON)))ON", "(NO(NON))O(NON)",
    "(NON)O((NON)ON)", "NO(((NON)ON)ON)", "NO((NO(NON))ON)", "NO((NON)O(NON))",
    "NO(NO((NON)ON))"
}; /// 42°³

int main(){
    int tmp1 = 0, tmp2 = 0;
    int oploc[4], noloc[5];
    for(int bracket=0; bracket<42; bracket++){
        string target = brackets[bracket];
        tmp1 = tmp2 = 0;
        for(int i=0; i<(int)target.size(); i++){
            if(target[i] == 'O') oploc[tmp1++] = i;
            else if(target[i] == 'N') noloc[tmp2++] = i;
        }
        for(int o1=0; o1<4; o1++) for(int o2=0; o2<4; o2++) for(int o3=0; o3<4; o3++)
        for(int o4=0; o4<4; o4++){
            target[oploc[0]] = oper[o1];
            target[oploc[1]] = oper[o2];
            target[oploc[2]] = oper[o3];
            target[oploc[3]] = oper[o4];
            for(int num = 0; num < 20; num++){
                for(int i=0; i<5; i++){
                    target[noloc[i]] = numbers[num][i];
                }
                double cal = calculate(inFixToPostFix(target));
                if(abs(cal - 38) < 1e-6) printf("%s: %.5f\n", target.c_str(), cal);
            }
        }
    }
}