#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#define REP(i,a,b) for(int i=a;i<=b;i++)
#define MS0(a) memset(a,0,sizeof(a))

using namespace std;

typedef long long ll;
const int maxn=1000100;
const int INF=(1<<29);

int n;
ll a[maxn];
ll b[maxn],m;
ll c[maxn];

int lowbit(int x)
{
    return x&(-x);
}

ll sum(int p)
{
    ll res=0;
    while(p>0){
        res+=c[p];
        p-=lowbit(p);
    }
    return res;
}

void add(int p,ll x)
{
    while(p<=m){
        c[p]+=x;
        p+=lowbit(p);
    }
}

int main()
{
    while(cin>>n,n){
        MS0(c);
        REP(i,1,n){
            scanf("%I64d",&a[i]);
            b[i]=a[i];
        }
        sort(b+1,b+n+1);
        m=unique(b+1,b+n+1)-(b+1);
        ll ans=0;
        REP(i,1,n){
            int x=lower_bound(b+1,b+n+1,a[i])-b;
            add(x,1);
            ans+=sum(m)-sum(x);
        }
        printf("%I64d\n",ans);
    }
    return 0;
}