#include<iostream>
#include<vector>

using namespace std;
/*
int mergesort(vectior<int> &v, int i, int j) {
	if(i==j) return 0;
	int i1 = mergesort(v, i, (i+j)/2);
	int i2 = mergesort(v, (i+j)/2, j);
	vector<int> res;
	int ia = i; ib=(i+j)/2;
	int inv=0;
	while(ia<(i+j)/2 && ib<j) {
		if(v[ia]<v[ib]) {
			res.push_back(v[ia]);
			ia++;
			int k = ia-(i+res.size());
			if(k>0) inv+=k;
		}
		else {
			res.push_back(v[ib]);
			ib++;
			int k = ib-(i+res.size());
			if(k>0) inv+=k;
		}
	}
	return inv+i1+i2;
}
*/
int main() {
	int n; 
	while(cin>> n) {
		vector<int> v(n);
		for(int i=0; i<n; i++) { cin >> v[i]; v[i]--; }
		int num=0;
		for(int i = 0; i<n; i++) {
			while(v[i]!=i) {
				num++;
				swap(v[i],v[v[i]]);
			}
		}
		cout << num << endl;
	}
}