#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int a[maxn], n;
int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        int x;
        scanf("%d", &x);
        a[x] = i;
    }
    int cnt = 0, now = 1;
    while (1)
    {
        while (a[0] != 0)
        {
            swap(a[0], a[a[0]]);
            cnt++;
        }
        while (now < n&&a[now] == now)now++;
        if (now == n)break;
        swap(a[0], a[now]);
        cnt++;
    }
    printf("%d", cnt);
    return 0;
}