#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
#include<math.h>
#include<algorithm>
#include<math.h>
#include<unordered_map>
#include<unordered_set>
#include<chrono>
using namespace std;
using namespace chrono;

#define official

#ifdef official
#define cin inF
#define cout outF
#endif

ifstream inF("product.in");
ofstream outF("product.out");

const int MAX_N=250;
const int ITERS=1000;

int n;
int a[MAX_N];
int ans;

void input()
{
    cin>>n;
    for (int i=0; i<n; ++i)
    {
        cin>>a[i];
    }
}
bool fair_share[MAX_N];
void gen_fair_shair()
{
    int p=1;
    int i=1;
    fair_share[0]=0;
    bool f=1;
    while (f)
    {
        for (;i<2*p;++i)
        {
            fair_share[i]=!fair_share[i-p];
            if (i>200)
            {
                f=0;
                break;
            }
        }
        p*=2;
    }
}
vector<int> nums[2];
int pro;
void output()
{
    cout<<pro<<' '<<nums[0].size()<<' '<<nums[1].size()<<'\n';
    for (int i=0;i<nums[0].size();++i)
    {
        if (i) cout<<' ';
        cout<<nums[0][i];
    }
    cout<<'\n';
    for (int i=0;i<nums[1].size();++i)
    {
        if (i) cout<<' ';
        cout<<nums[1][i];
    }
    cout<<'\n';
}
bool cmp(int a, int b)
{
    return a>b;
}
void shuffle()
{
    for (int i=n-1;i>0;--i)
    {
        swap(a[i],a[rand()%(i+1)]);
    }
}
vector<int> cnums[2];
int cpro;
high_resolution_clock::time_point startT,currT;
void solve()
{
    bool f;
    sort(a,a+n,cmp);
    gen_fair_shair();
    int sum[2]={0,0};
    for (int i=0;i<n;++i)
    {
        if (sum[0]<=sum[1]) f=0;
        else f=1;
        sum[f]+=a[i];
        nums[f].push_back(a[i]);
    }
    pro=sum[0]*sum[1];


    sum[0]=0;
    sum[1]=0;
    cnums[0].resize(0);
    cnums[1].resize(0);
    for (int i=0;i<n;++i)
    {
        f=fair_share[i];
        sum[f]+=a[i];
        cnums[f].push_back(a[i]);
    }
    cpro=sum[0]*sum[1];
    if (cpro>pro)
    {
        pro=cpro;
        nums[0]=cnums[0];
        nums[1]=cnums[1];
    }

    currT=high_resolution_clock::now();
    while (duration_cast<duration<double>>(currT-startT).count()<0.4)
    {
        shuffle();
        sum[0]=0;
        sum[1]=0;
        cnums[0].resize(0);
        cnums[1].resize(0);
        for (int i=0;i<n;++i)
        {
            if (sum[0]<=sum[1]) f=0;
            else f=1;
            sum[f]+=a[i];
            cnums[f].push_back(a[i]);
        }
        cpro=sum[0]*sum[1];
        if (cpro>pro)
        {
            pro=cpro;
            nums[0]=cnums[0];
            nums[1]=cnums[1];
        }
        currT=high_resolution_clock::now();
    }
}

int main()
{
    startT=high_resolution_clock::now();
    currT=high_resolution_clock::now();
    srand(0);

    input();
    solve();
    output();

    return 0;
}