#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N;
vector<P> v;

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

    std::cin >> N;

    for(int i=0;i<N;++i){
        int a;
        std::cin >> a;

        v.emplace_back(a, i);
    }

    sort(v.rbegin(), v.rend());

    int i = 0;
    while(i + 1 < N && snd(v[i]) > snd(v[i + 1])){
        ++i;
    }

    std::cout << N - (i + 1) << std::endl;
}