BT

#include <iostream>
using namespace std;
#define N 500000
int countt = 0;
int mas[N];
void solve(int i) {
    int num = mas[i];
    if (mas[i] != mas[i + 1]) mas[i] = 0;
    if(num <= mas[i + 1]  )countt++;
    while (num > mas[i + 1]) {
        countt++;
        i++;
    }
}
int main() {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> mas[i];
    }
    for (int i = 0; i < n - 1; i++) {
        solve(i);
    }
    cout << countt;
    return 0;

}