#include "bits/stdc++.h"
using namespace std;
using ll = long long; using ull = unsigned long long;
//#define int ll
using vb = vector<bool>; using vvb = vector<vb>;
using vi = vector<int>; using vvi = vector<vi>;
using vl = vector<ll>; using vvl = vector<vl>;
template<class T> using V = vector<T>;
template<class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x,y) (x=max(x,y))
#define mins(x,y) (x=min(x,y))
using pii = pair<int,int>; using pll = pair<ll,ll>;
#define FOR(i,a,b) for(ll i = (a); i < (ll)(b); ++i)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(ll i = (ll)(b)-1;i >= a;--i)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define eb(val) emplace_back(val)
const double PI = acos(-1),EPS = 1e-10;
const ll MOD = 1e9+7;
void cioacc(){//accelerate cin/cout
  cin.tie(0);
  ios::sync_with_stdio(false);
}
ll w;
int bubble_sort(vector<int> &vec){
  int res = 0;
  for(int i=0;i<(int)vec.size();++i){
    for(int j=0;j<(int)vec.size()-i-1;++j){
      if(vec.at(j)>vec.at(j+1))  swap(vec.at(j),vec.at(j+1)),++res;
    }
  }  
  return res;
}
int main(){
  int n;
  while(cin >> n,n){
    vector<int> vec(n);
    REP(i,n){
      cin >> vec.at(i);
    }
    //REP(i,n){
    //  cout << vec.at(i) << endl;
    //}
    cout << bubble_sort(vec) << endl;
  }
}
