#include <bits/stdc++.h>
using namespace std;
 
int main() 
{
    int n;
    cin>>n;
 
    int b[n+1]; // 1 - based indexing
    for(int i=1; i<=n; i++)
    {
        cin>>b[i];
    }
 
    int ans = -1;
 
    for(int i=1; i<=n; i++)
    {
        int product = 1; // Initially the product will be 1
 
        for(int j=i; j<=n; j++)
        {
            //              product * current element
            product = product * b[j];
 
            ans = max (ans , product); // take maximum of all of products 
        }
    }
    cout<<ans;
 
    return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIAp7CiAgICBpbnQgbjsKICAgIGNpbj4+bjsKCiAgICBpbnQgYltuKzFdOyAvLyAxIC0gYmFzZWQgaW5kZXhpbmcKICAgIGZvcihpbnQgaT0xOyBpPD1uOyBpKyspCiAgICB7CiAgICAgICAgY2luPj5iW2ldOwogICAgfQoKICAgIGludCBhbnMgPSAtMTsKCiAgICBmb3IoaW50IGk9MTsgaTw9bjsgaSsrKQogICAgewogICAgICAgIGludCBwcm9kdWN0ID0gMTsgLy8gSW5pdGlhbGx5IHRoZSBwcm9kdWN0IHdpbGwgYmUgMQogICAgICAgIAogICAgICAgIGZvcihpbnQgaj1pOyBqPD1uOyBqKyspCiAgICAgICAgewogICAgICAgICAgICAvLyAgICAgICAgICAgICAgcHJvZHVjdCAqIGN1cnJlbnQgZWxlbWVudAogICAgICAgICAgICBwcm9kdWN0ID0gcHJvZHVjdCAqIGJbal07CgogICAgICAgICAgICBhbnMgPSBtYXggKGFucyAsIHByb2R1Y3QpOyAvLyB0YWtlIG1heGltdW0gb2YgYWxsIG9mIHByb2R1Y3RzIAogICAgICAgIH0KICAgIH0KICAgIGNvdXQ8PGFuczsKCiAgICByZXR1cm4gMDsKfQ==

NAoyIDMgLTIgNA==

4
2 3 -2 4