#include<cstdio>
int a[600000],temp[600000],n;
long long sum;
void mergeArray(int l,int r)
{
int lStart = l,lEnd = (l+r)/2,
rStart = (l+r)/2+1,rEnd = r,
i1 = 0;
while(lStart<=lEnd&&rStart<=rEnd)
{
if(a[lStart]<=a[rStart])
{
temp[i1] = a[lStart];
lStart++;
i1++;
}
else
{
sum+=(long long)(lEnd-lStart+1);
temp[i1] = a[rStart];
rStart++;
i1++;
}
}
for(int i=lStart;i<=lEnd;i++)
{
temp[i1] = a[i];
i1++;
}
for(int i=rStart;i<=rEnd;i++)
{
temp[i1] = a[i];
i1++;
}
for(int i=l;i<=r;i++)
a[i] = temp[i-l];
}
void mergeSort(int l,int r)
{
if(l<r)
{
mergeSort(l,(r+l)/2);
mergeSort((r+l)/2+1,r);
mergeArray(l,r);
}
}
int main()
{
while(scanf("%d",&n)&&n)
{
sum = 0;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
mergeSort(0,n-1);
printf("%I64d\n",sum);
}
return 0;
}