#include #include int main() { int n, i, y, *pole, pocet; while((scanf("%d\n", &n) == 1)) { pocet = 0; pole = (int*)malloc(sizeof(int)*n); _Bool vyhovuje = 1; for(i = 0; i < n; i++) { scanf("%d", &pole[i]); if(pole[i] != i+1) vyhovuje = 0; } if(vyhovuje == 0) { for(i = n-1; i > 0; i--) { if(pole[i] != i+1) { for(y = 0; y < i+1; y++) { if(i+1 == pole[y]) { pocet++; int temp = pole[i]; pole[i] = i+1; pole[y] = temp; break; } } } } } printf("%d\n", pocet); } return 0; }