#include <bits/stdc++.h>
int int_vector_find(std::vector<int> vec, int num) {
  auto itr = std::find(vec.begin(), vec.end(), num);
  int index = std::distance(vec.begin(), itr);
  if (index != vec.size()) {
    return 1;
  } else {
    return 0;
  }
}
int main() {
  std::vector<int> vec;
  int n;
  std::cin >> n;
  int ans = 1;
  for (int i = 0; i < n; ++i) {
    int a;
    std::cin >> a;
    vec.push_back(a);
  }
  for (int i = 1; i < n; ++i) {
    if (vec[i - 1] <= vec[i]) {
      ans++;
    }
  }
  std::cout << ans << std::endl;
}
