#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <stack>
#include <queue>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define repc(i,s,e) for(int i=(s); i<(e); i++)
#define pb(n) push_back((n))
#define mp(n,m) make_pair((n),(m))
#define all(r) r.begin(),r.end()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;




int main() {
	int n;
	int ans, t;
	vi v(110, 0);
	while (cin >> n) {
		if (n == 0)break;
		ans = 0;
		rep(i, n) {
			cin >> v[i];
		}
		rep(i, n) {
			for (int j = 0; j < n - i - 1; j++) {
				if (v[j] > v[j + 1]) {
					t = v[j];
					v[j] = v[j + 1];
					v[j + 1] = t;
					ans++;
				}
			}
		}
		/*rep(i, n) {
			cout << v[i] << " ";
		}
		cout << endl;*/
		cout << ans << endl;
	}
}