#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int n;
int a[100000];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> n;
	rep(i,0,n) cin >> a[i];

	int ans = 0;
	rev(i,n,0) {
		if(i+1 == a[i]) continue;
		else if(i+1 > a[i]) {
			int num = 1, j = i-1;
			while(i+1 != a[j] && j > 0) {
				j--;
				num++;
			}
			int cnt = 0;
			while(cnt < num) {
				int max = i;
				rev(k, i, j+1) if(a[max] < a[k]) max = k;
				int tmp = a[max];
				rev(k, max+1, 0) a[k] = a[k-1];
				a[0] = tmp;

				cnt++;
				ans++;
				j++;
			}
		}

	}
	cout << ans << endl;

	return 0;
}