#include<cstdio>

 #include<cstdlib>

 #include<cstring>

 #include<iostream>

 #include<algorithm>

 #include<queue>

 #include<cmath>

 using namespace std;

 #define Maxn 1010

 #define INF 0xfffffff

 struct node

 {

     int x,y,f,o,c,next;

 }t[Maxn*Maxn];int len;

 int first[Maxn];

 int mymin(int x,int y) {return x<y?x:y;}

 int mymax(int x,int y) {return x>y?x:y;}

 void ins(int x,int y,int f,int c)

 {

     t[++len].x=x;t[len].y=y;t[len].f=f;t[len].c=c;

     t[len].next=first[x];first[x]=len;t[len].o=len+;

     t[++len].x=y;t[len].y=x;t[len].f=;t[len].c=-c;

     t[len].next=first[y];first[y]=len;t[len].o=len-;

 }

 int st,ed;

 queue<int > q;

 int dis[Maxn],pre[Maxn],flow[Maxn];

 bool inq[Maxn];

 bool bfs()

 {

     while(!q.empty()) q.pop();

     memset(dis,,sizeof(dis));

     memset(inq,,sizeof(inq));

     q.push(st);dis[st]=;flow[st]=INF;inq[st]=;

     while(!q.empty())

     {

         int x=q.front();

         for(int i=first[x];i;i=t[i].next) if(t[i].f>)

         {

             int y=t[i].y;

             if(dis[y]>dis[x]+t[i].c)

             {

                 dis[y]=dis[x]+t[i].c;

                 pre[y]=i;

                 flow[y]=mymin(flow[x],t[i].f);

                 if(!inq[y])

                 {

                     inq[y]=;

                     q.push(y);

                 }

             }

         }

         inq[x]=;q.pop();

     }

     if(dis[ed]>=INF-) return ;

     return ;

 }

 void output()

 {

     for(int i=;i<=len;i+=)

      printf("%d->%d %d %d\n",t[i].x,t[i].y,t[i].f,t[i].c);

     printf("\n");

 }

 int max_flow()

 {

     int ans=,sum=;

     while(bfs())

     {

         sum+=dis[ed]*flow[ed];

         ans+=flow[ed];

         int now=ed;

         while(now!=st)

         {

             t[pre[now]].f-=flow[ed];

             t[t[pre[now]].o].f+=flow[ed];

             now=t[pre[now]].x;

         }

     }

     return sum;

 }

 int n,a[Maxn];

 void init()

 {

     int h=;

     scanf("%d",&n);

     st=n+;ed=st+;

     len=;

     memset(first,,sizeof(first));

     for(int i=;i<=n;i++)

     {

         scanf("%d",&a[i]);

         ins(st,i,a[i],);

         h+=a[i];

     }

     h/=n;

     for(int i=;i<n;i++) ins(i,i+,INF,);ins(n,,INF,);

     for(int i=;i<=n;i++) ins(i,i-,INF,);ins(,n,INF,);

     for(int i=;i<=n;i++) ins(i,ed,h,);

 }

 int main()

 {

     init();

     // output();

     // return 0;

     int ans;

     ans=max_flow();

     printf("%d\n",ans);

     return ;

 }