#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<int> a(N);
    for(int i = 0; i < N; ++i)  cin >> a[i];

    ll ans = -1e+17;
    auto dfs = [&](auto&& self, ll sum, int i = 1) -> void {
        if(i == N){
            chmax(ans, sum);
            return;
        }
        if(a[i] == 0){
            self(self, sum, i + 1);
            self(self, 0LL, i + 1);
        }
        else{
            self(self, sum + a[i], i + 1);
            self(self, sum - a[i], i + 1);
            self(self, sum * a[i], i + 1);
            self(self, sum / a[i], i + 1);
        }
    };
    dfs(dfs, a[0]);

    cout << ans << endl;

    return 0;
}