#include <bits/stdc++.h>
using namespace std;
const int INF=1e9;
int mx=-INF;
int main(){

    int n;
    scanf("%d",&n);
    int ar[n+1];
    for(int i=1;i<=n;i++){
        scanf("%d",&ar[i]);
    }

    vector <int> keep,ans;
    for(int i=1;i<=n;i++){
        int cnt=0;
        for(int j=i;j<=n;j++){
            cnt=cnt+ar[j];
            keep.push_back(ar[j]);
            if(cnt>mx) {
                mx=cnt;
                if(ans.size()>0) ans.clear();
                for(int j=0;j<keep.size();j++) ans.push_back(keep[j]);
            }
        }
        keep.clear();
    }
    if(mx<=0) printf("Empty sequence");
    else {
        for(int i=0;i<ans.size();i++) printf("%d ",ans[i]);
        printf("\n%d",mx);
    }


    return 0;
}