#include <bits/stdc++.h>

using namespace std;
void allCombinations(int arr[], int sol[], int start, int end, 
                     int index, int r);
void printCombination(int arr[], int n, int r)
{
    int sol[r];
  allCombinations(arr, sol, 0, n-1, 0, r);
}
int a[10][2],k;
void allCombinations(int arr[], int sol[], int start, int end,
                     int index, int r)
{
    // Current combination is ready to be printed, print it
    if (index == r)
    {
        for (int j=0; j<r; j++)
            a[k][j]=sol[j];
        k++;
       return;
    }
   
    for (int i=start; i<=end && end-i+1 >= r-index; i++)
    {
        sol[index] = arr[i];
        allCombinations(arr, sol, i+1, end, index+1, r);
    }
}
  
int maxSubArraySum(int a[], int size)
{
    int max_so_far = INT_MIN, max_ending_here = 0;
 
    for (int i = 0; i < size; i++)
    {
        max_ending_here = max_ending_here + a[i];
        if (max_so_far < max_ending_here)
            max_so_far = max_ending_here;
 
        if (max_ending_here < 0)
            max_ending_here = 0;
    }
    return max_so_far;
}
void seg_max(int *v, int n, int & x, int &y , int & max){
 int i,j;
 int soma; 
 max = -1; 
 for(i=0;i<n;i++){
  soma = 0;
  for(j=i;j<n;j++){
   soma += v[j];
   if( soma > max ){
    max = soma;
    x = i;
    y = j;
   }
  }
 }
}

//long largestValue(int A) { }

int main() {
    int n;
    cin >> n;
   int A[n];
    for(int A_i = 0; A_i < n; A_i++){
       cin >> A[A_i];
    }
    int r=2;
    
   // long result = largestValue(A);
   // cout << result << endl;
    printCombination(A, n, r);
    int pro[k]={0};
    for(int i=0;i<k;i++)
    {
        pro[i]+=a[i][0]*a[i][1];
       cout<<pro[i]<<" ";           
    }int x,y,m;
    seg_max(pro,k,x,y,m);
    //int m = maxSubArraySum(pro, k);
    cout<<endl<<m;
    return 0;
}