#include <iostream>
#include <fstream>
#include <iomanip>

#define MAGIC 2147483647
#define MINUSINF -2147483647
#define INF 2147483647
using namespace std;

long liczba[501];
char znak[500];
long maks[500][500];
long mini[500][500];

long tmp[500];

long getMaxSum(int from, int i, int to); //forward declaration
long getMaxDiff(int from, int i, int to);
long getMaxMult(int from, int i, int to);
long getMinSum(int from, int i, int to);
long getMinDiff(int from, int i, int to);
long getMinMult(int from, int i, int to);
long getMax(int from, int to);
long getMin(int from, int to);

void printMaxMin(int n){

    cout << "max";
    for(int i=0; i<n; i++){
        cout << "\t" << setfill('0') << setw(11) << i;
    }
    cout << endl;
    for(int i=0; i<n; i++){
        cout << i << "|";
        for(int j=0; j<n; j++){
            cout << "\t" << setfill('0') << setw(11) << maks[i][j];
        }
        cout << endl;

    }

    cout << "min";
    for(int i=0; i<n; i++){
        cout << "\t" << setfill('0') << setw(11) << i;
    }
    cout << endl;
    for(int i=0; i<n; i++){
        cout << i << "|";
        for(int j=0; j<n; j++){
            cout << "\t" << setfill('0') << setw(11) << mini[i][j];
        }
        cout << endl;

    }
}


int readFile(){
    ifstream in;
    in.open("in");
    int i=0;
    while(!in.eof()){
        in >> liczba[i];
        in >> znak[i];
        i++;
    }
    return i;
}

void initArrays(int n){
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            maks[i][j] = MAGIC;
            mini[i][j] = MAGIC;
        }
        maks[i][i] = liczba[i];
        mini[i][i] = liczba[i];
    }
}

int evaluate(int i){
    if(maks[i][i+1] != MAGIC)
        return maks[i][i+1];

    int result;
    if(znak[i]=='*')
        result = liczba[i]*liczba[i+1];
    if(znak[i]=='+')
        result = liczba[i]+liczba[i+1];
    if(znak[i]=='-')
        result = liczba[i]-liczba[i+1];

    maks[i][i+1] = result;
    mini[i][i+1] = result;
    return result;
}

long getMaxSum(int from, int i, int to){
    return getMax(from, i) + getMax(i+1, to);
};
long getMaxDiff(int from, int i, int to){
    return getMax(from, i) - getMin(i+1, to);
};

long getMaxMult(int from, int i, int to){
    long tmp[4];
    tmp[0] = getMax(from, i) * getMax(i+1, to);
    tmp[1] = getMax(from, i) * getMin(i+1, to);
    tmp[2] = getMin(from, i) * getMax(i+1, to);
    tmp[3] = getMin(from, i) * getMin(i+1, to);

    for(int i=1; i<4; i++){
        if(tmp[i]>tmp[0])
            tmp[0] = tmp[i];
    }
    return tmp[0];
};

long getMinSum(int from, int i, int to){
    return getMin(from, i) + getMin(i+1, to);
};
long getMinDiff(int from, int i, int to){
    return getMin(from, i)-getMax(i+1, to);
};
long getMinMult(int from, int i, int to){
    long tmp[4];
    tmp[0] = getMax(from, i) * getMax(i+1, to);
    tmp[1] = getMax(from, i) * getMin(i+1, to);
    tmp[2] = getMin(from, i) * getMax(i+1, to);
    tmp[3] = getMin(from, i) * getMin(i+1, to);

    for(int i=1; i<4; i++){
        if(tmp[i]<tmp[0])
            tmp[0] = tmp[i];
    }
    return tmp[0];
};

long getMax(int from, int to){
    if(maks[from][to] != MAGIC)
        return maks[from][to];

    if((from-to) == 1){
        return evaluate(from);
    }
    long tmp;
    long max = MINUSINF;
    for(int i=0; i<(to-from); i++){
        if(znak[i+from]=='+')
            tmp = getMaxSum(from, from+i, to);
        if(znak[i+from]=='-')
            tmp = getMaxDiff(from, from+i, to);
        if(znak[i+from]=='*')
            tmp = getMaxMult(from, from+i, to);
        if(tmp > max)
            max = tmp;
    }

    maks[from][to] = max;
    return max;

}

long getMin(int from, int to){
    if(mini[from][to] != MAGIC)
        return mini[from][to];

    if((from-to) == 1){
        return evaluate(from);
    }

    long tmp;
    long min = INF;
    for(int i=0; i<(to-from); i++){
        if(znak[i+from]=='+')
            tmp = getMinSum(from, from+i, to);
        if(znak[i+from]=='-')
            tmp = getMinDiff(from, from+i, to);
        if(znak[i+from]=='*')
            tmp = getMinMult(from, from+i, to);
        if(tmp < min)
            min = tmp;
    }
    mini[from][to] = min;
    return min;
}

int main(){
    int n = readFile();
    initArrays(n);
    n--;
    cout << n<<endl;
    cout << getMax(0,n)<<endl;
    cout << getMin(0,n)<<endl;
    //printMaxMin(n+1);
    return 0;
}