#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, a;
    cin >> N;
    set<ll> dp;
    cin >> a;
    dp.emplace(a);
    for(int i = 1; i < N; ++i){
        cin >> a;
        set<ll> nxt;
        for(auto x : dp){
            if(a == 0){
                nxt.emplace(x);
                nxt.emplace(0);
            }
            else{
                nxt.emplace(x + a);
                nxt.emplace(x - a);
                nxt.emplace(x * a);
                nxt.emplace(x / a);
            }
        }
        dp = move(nxt);
    }
    cout << *dp.rbegin() << endl;

    return 0;
}