#include<cstdio>

 using namespace std;

 struct point {

     int l,r,sum;

 };

 point tree[*];

 int a[];

 int n;

 void build(int i,int left,int right)

 {

     tree[i].l=left,tree[i].r=right;

     tree[i].sum=;

     if (left==right) return ;

     int mid=(left+right)/;

     build(i*,left,mid);

     build(i*+,mid+,right);

 }

 int find(int i,int pos)

 {

     if (pos<=tree[i].l) return tree[i].sum;

     int mid=(tree[i].l+tree[i].r)/;

     int a=,b=;

     if (pos<=mid)

        a=find(i*,pos);

     if (n->mid)

        b=find(i*+,pos);

     return a+b;

 }

 void update(int i,int pos)

 {

     if (pos==tree[i].l&&pos==tree[i].r)

     {

        tree[i].sum=;

        return ;

     }

     int mid=(tree[i].l+tree[i].r)/;

     if (pos<=mid)

         update(i*,pos);

     else

         update(i*+,pos);

     tree[i].sum=tree[i*].sum+tree[i*+].sum;

 }

 int main()

 {

     int ans,i,min;

     while (~scanf("%d",&n))

     {

         if (n==) break;

         ans=;

         build(,,n-);

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

         {

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

            ans+=find(,a[i]+);

            update(,a[i]);

         }

         min=ans;

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

         {

             ans=ans+n--*a[i];

             if (ans<min)

               min=ans;

         }

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

     }

     return ;

 }