var a,temp:array[1..10000]of longint;

m,n,k,tt:longint;

procedure qsort(l,r:longint);

var i,j,x,y:longint;

begin

i:=l;j:=r;

x:=a[(l+r) div 2];

repeat

while a[i]<x do inc(i);

while x<a[j] do dec(j);

if i<=j then

begin

y:=a[i];

a[i]:=a[j];

a[j]:=y;

inc(i);

dec(j);

end;

until i>j;

if i<r then qsort(i,r);

if l<j then qsort(l,j);

end;

procedure work(l:longint);

begin

tt:=tt+a[1]+a[2];

for n:=1 to l-2 do

a[n]:=a[n+2];

a[l-1]:=tt;

qsort(1,l-1);

end;

begin

readln(m);

for n:=1 to m do

read(a[n]);

qsort(1,m);

for k:=1 to m-1 do

work(m+1-k);

write(tt);

end.