Dlya Pidora

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int INF=2147483647;
int inf=-2147483648;
int mod=1000000007;
#define read(x) cin >> x;
#define fo(i,n) for(i=0;i<n;i++)
#define one(x) cout<<(x)<<endl;
#define two(a,b) cout<<(a)<<" "<<(b)<<endl;
#define three(a,b,c) cout<<(a)<<" "<<(b)<<" "<<(c)<<endl;
#define four(a,b,c,d) cout<<(a)<<" "<<(b)<<" "<<(c)<<" "<<(d)<<endl;
#define write(a,i) cout << a[i] << " ";
int main()
{
    int n,a[100],sum[100],sum_m=0,i_m,i,k,minn=INT_MAX;
    cin >> n;fill(sum,sum+n,0);
    for (i=0;i<n;i++)
    {
        cin >> a[i]; if (i==0) sum[i]=a[i]; else sum[i]=sum[i-1]+a[i];
    }
    sum_m=sum[n-1];
    cout << sum_m << endl;
    for (i=0;i<n;i++)
    {
        k=sum_m-sum[i];
      //  if (abs(sum_m-k-a[i])<minn) { minn=abs(sum_m-k-a[i]);i_m=i; }
         if (abs(k-sum[i]+a[i])<minn) { minn=abs(k-sum[i]+a[i]);i_m=i; }
        cout << sum[i] << " " << a[i] << " " << minn << " " << sum_m-k-a[i]<<" " << k << " " << abs(k-sum[i]+a[i]) <<  endl;;
    }
    cout << i_m + 1;
    return 0;
}