#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <iomanip>
#include <cassert>
using namespace std;

#define GET_ARG(a,b,c,F,...) F
#define REP3(i,s,e) for (i = s; i <= e; i++)
#define REP2(i,n) REP3 (i,0,(int)(n)-1)
#define REP(...) GET_ARG (__VA_ARGS__,REP3,REP2) (__VA_ARGS__)
#define RREP3(i,s,e) for (i = s; i >= e; i--)
#define RREP2(i,n) RREP3 (i,(int)(n)-1,0)
#define RREP(...) GET_ARG (__VA_ARGS__,RREP3,RREP2) (__VA_ARGS__)
#define DEBUG(x) cerr << #x ": " << x << endl

typedef long long ll;

int a[16];

ll dfs(int i, int n, ll x) {
    if (i == n) return x;
    ll ret = -1e9;
    ret = max(ret,dfs(i+1,n,x-a[i]));
    if (x >= 0 || a[i] <= 0 || x+a[i] > x/a[i])
        ret = max(ret,dfs(i+1,n,x+a[i]));
    else
        ret = max(ret,dfs(i+1,n,x/a[i]));
    ret = max(ret,dfs(i+1,n,x*a[i]));
    return ret;
}

int main(void) {
    int i, n;
    cin >> n;
    REP (i,n) cin >> a[i];
    cout << dfs(1,n,a[0]) << endl;
    return 0;
}