#include<bits/stdc++.h> using namespace std; int main(){ int n,a[10005],b[10005],sum=0; queue<int> ta; cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; ta.push(a[i]); } int t,minn=0x3f3f3f3f; for(int c=1;c<n;c++){ minn=0x3f3f3f3f; for(int i=1;i<=n-c+1;i++){ b[i]=ta.front(); cout<<b[i]<<" "; ta.pop(); } for(int i=1;i<=n-c;i++){ if(b[i]+b[i+1]<minn){ t=i; minn=b[i]+b[i+1]; } } sum+=minn; b[t]+=b[t+1]; b[t+1]=-1; for(int i=1;i<=n-c+1;i++){ if(b[i]>=0) ta.push(b[i]); } cout<<endl; } cout<<sum; return 0; }