#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using Graph = vector<VecP>;
void sonic() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
}
void setp(const long long n) { cout << fixed << setprecision(n); }
const long long INF = 1e9 + 1;
const long long LINF = 1e18 + 1;
const long long MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-11;
template <class T>
bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
void co(T e) {
  cout << e << "\n";
}
template <typename T>
void co(const vector<T> &v) {
  for (const auto &e : v) {
    cout << e << " ";
  }
  cout << "\n";
}
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  unsigned r;
  while ((r = a % b)) {
    a = b;
    b = r;
  }
  return b;
}
long long lcm(long long a, long long b) {
  long long g = gcd(a, b);
  return a * b / g;
}
bool prime(long long n) {
  for (long long i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return n != 1;
}
Vec fac, finv;
long long PowMod(long long a, long long n) {
  if (n == 1) return a;
  if (n % 2 == 0) return PowMod(a * a % MOD, n / 2);
  return a * PowMod(a * a % MOD, n / 2) % MOD;
}
long long combi(long long n, long long k) {
  if (k > n) return 0;
  return fac[n] * finv[k] % MOD * finv[n - k] % MOD;
}
int main() {
  int n, h1, ans = 0;
  cin >> n >> h1;
  for (long long(i) = (0); (i) < (n - 1); ++(i)) {
    int h;
    cin >> h;
    if (h >= h1) ans++;
  }
  co(ans);
}
