#include <iostream> #include <cstdio> #include <algorithm> using namespace std; int main() { int n; cin >> n; int cows[100], sorted[100]; for (int i = 0; i < n; i++) { cin >> cows[i]; sorted[i] = cows[i]; } sort(sorted, sorted + n); int swaps = 0; for (int i = 0; i < n; i++) { if (cows[i] != sorted[i]) { swaps++; } } cout << swaps - 1 << endl; return 0; }