import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long largestValue(int n,int[] A) 
    {
        int l=0;
        int k=A[0];
        for(int i=1;i<n;i++)
        {
            l=l*A[i];
            if(k<l)
            {
                k=l;
            }
            if(l<0)
            {
                l=0;
            }
        }
        return k;
       
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] A = new int[n];
        for(int A_i = 0; A_i < n; A_i++){
            A[A_i] = in.nextInt();
        }
        long result = largestValue(n,A);
        System.out.println(result);
        in.close();
    }
}