#include <bits/stdc++.h>
using namespace std;
int main() {
  int count = 0;
  int target;
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  const int size = sizeof(A) / sizeof(A[0]);
  count++;
  if (A[0] <= A[1]) {
    count++;
  }
  for (int j = 2; j < N - 1; j++) {
    partial_sort(A.begin(), A.begin() + (j - 1), A.end());
    if (A[j - 1] <= A[j]) {
      count++;
    }
  }
  if (A[N - 2] <= A[N - 1]) {
    count++;
  }
  cout << count << endl;
}
