#include<bits/stdc++.h>
using namespace std;
int n,m[256];
bool f[256];
vector<int> max1,max2,ev;
int maxp,maxbr1,maxbr2,maxs1,maxs2;
void rec(int s1=0,int s2=0,int br1=0,int br2=0,vector<int> v1=ev,vector<int> v2=ev)
{
    if(br1+br2==n)
    {
        int p=s1*s2;
        if(p>maxp){maxp=p;maxbr1=br1;maxbr2=br2;maxs1=s1;maxs2=s2;max1=v1;max2=v2;}
        memset(f,0,sizeof(f));
        return ;
    }
    for(int i=0;i<n;i++)
    {
        if(!f[i])
        {
            vector<int> v11=v1,v22=v2;
            v11.push_back(m[i]);
            v22.push_back(m[i]);
            f[i]=1;
            rec(s1+m[i],s2,br1+1,br2,v11,v2);
            f[i]=1;
            rec(s1,s2+m[i],br1,br2+1,v1,v22);
            f[i]=1;
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    freopen("product.in","r",stdin); freopen("product.out","w",stdout);
    cin>>n;
    for(int i=0;i<n;i++) cin>>m[i];
    sort(m,m+n);
    rec();
    cout<<maxp<<" "<<maxbr1<<" "<<maxbr2<<endl;
    int x=max1.size();
    cout<<max1[0]; for(int i=1;i<x;i++) cout<<" "<<max1[i]; cout<<endl;
    x=max2.size();
    cout<<max2[0]; for(int i=1;i<x;i++) cout<<" "<<max2[i]; cout<<endl;
    return 0;
}