#include<string>
#include<vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<list>
#include<set>
#include<map>
#include<cstring>
#include<sstream>
#include<cassert>
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

int main()
{
    int n;
    static int a[16];
    cin >> n;
    rep(i, n) {
        cin >> a[i];
    }
    
    static ll dp[16][2];
    for(int i=0; i<n; i++) dp[i][0]=1LL<<60,dp[i][1]=-(1LL<<60);
    dp[0][0] = a[0];
    dp[0][1] = a[0];
    for (int i = 1; i < n; ++i) {
        dp[i][0] = min(dp[i][0], dp[i-1][0] + a[i]);
        dp[i][0] = min(dp[i][0], dp[i-1][0] - a[i]);
        dp[i][0] = min(dp[i][0], dp[i-1][0] * a[i]);
        if (a[i])
            dp[i][0] = min(dp[i][0], dp[i-1][0] / a[i]);
        
        dp[i][0] = min(dp[i][0], dp[i-1][1] + a[i]);
        dp[i][0] = min(dp[i][0], dp[i-1][1] - a[i]);
        dp[i][0] = min(dp[i][0], dp[i-1][1] * a[i]);
        if (a[i])
            dp[i][0] = min(dp[i][0], dp[i-1][1] / a[i]);
        
        
        dp[i][1] = max(dp[i][1], dp[i-1][0] + a[i]);
        dp[i][1] = max(dp[i][1], dp[i-1][0] - a[i]);
        dp[i][1] = max(dp[i][1], dp[i-1][0] * a[i]);
        if (a[i])
            dp[i][1] = max(dp[i][1], dp[i-1][0] / a[i]);
        
        dp[i][1] = max(dp[i][1], dp[i-1][1] + a[i]);
        dp[i][1] = max(dp[i][1], dp[i-1][1] - a[i]);
        dp[i][1] = max(dp[i][1], dp[i-1][1] * a[i]);
        if (a[i])
            dp[i][1] = max(dp[i][1], dp[i-1][1] / a[i]);
    }
    
    cout << dp[n-1][1] << endl;
    return 0;
}