#include <stdio.h>
#include <iostream>
#include <algorithm>
using namespace std;
int main () {
	FILE *in; FILE *out;
	in = fopen("product.in", "rt"); out = fopen("product.out", "wt");
  int n,g1=0,g2=0,pro,prod,n1,n2;
  fscanf(in,"%d",&n);
  if (n<2 || n>200)
  {
  	fprintf(out,"error");
  	return 0;
  }
  int a[n],b1[n],b2[n];
  for(int i =0;i<n;i++
  ){
  	fscanf(in,"%d",&a[i]);
  	
  }
  sort (a,a+n);
  do {
    for (int i = 0; i <=(n/2);i++)
    {
    	g1+=a[i];
	}
	for(int i = n-1; i >(n/2);i--)
	{
		g2+=a[i];
	}
	pro=g1*g2;
	if(pro>prod)
	{
		prod=pro;n1=0;n2=0;
		for(int i = 0 ; i<=(n/2);i++)
		{
			b1[i]=a[i];
			n1++;
		}
		for(int i = n-1 ; i>(n/2);i--)
		{
			b2[i]=a[i];
			n2++;
		}
	}
	g1=0;g2=0;pro=0;
  } while (next_permutation(a,a+n) );

  fprintf(out,"%d %d %d\n",prod,n1,n2);
  for(int i = 0 ; i<(n/2);i++)
		{
			fprintf(out,"%d ",b1[i]);	
		}
		
	fprintf(out,"%d\n",b1[n-n1]);
	for(int i = n-n2 ; i<n-1;i++)
		{
			fprintf(out,"%d ",b2[i]);
		}
		fprintf(out,"%d\n",b2[n-1]);
	fclose(in);
	fclose(out);
  return 0;
}