#include <iostream>
#include <iterator>
#include <algorithm>
#include<map>
#define ll long long
using namespace std;
ll a[1008611],b[1008611];
ll cnt=0;
void Merge(int l,int mid,int r){
int i=l,j=mid+1;
for(int k=l;k<=r;k++){
if(j>r||(i<=mid&&a[i]<=a[j]))b[k]=a[i++];
else{
b[k]=a[j++];
cnt+=mid-i+1;
}
}
for(int k=l;k<=r;k++)a[k]=b[k];
}
void Merge_sort(int l,int r){
if(l<r){
int mid=(l+r)/2;
Merge_sort( l, mid);
Merge_sort(mid+1, r);
Merge(l, mid, r);
}
}
int main(){
int n;
while(cin>>n&&n){
cnt=0;
for(int i=0;i<n;i++){
cin>>a[i];
}
Merge_sort(0, n-1);
cout<<cnt<<endl;
}
return 0;
}