#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

struct range {
  ll l, r;
  ll d() const { return r-l; };
  bool operator< (const range &x) const { 
    return d()<x.d() || (d()==x.d()&&l<x.l);
  };
};

int main() {
  ll N; cin >> N;
  ll A[N]; rep(i,N) cin >> A[i];

  ll MA = 2*pow(10,5) + 10;
  set<ll> s = {0};
  priority_queue<range> pq; pq.push((range){0,MA});
  ll result = 0;
  rep(i,N) {
    ll d = A[i] - *(--s.upper_bound(A[i]));
    if (!d) continue;
    queue<range> q;
    while (pq.size() && pq.top().d()>=d) {
      range now = pq.top(); pq.pop();
      q.push((range){now.l, now.l+d});
      q.push((range){now.l+d, now.r});
      s.insert(now.l+d);
    }
    while (q.size()) {
      pq.push(q.front()); q.pop();
    }
    result++;
    // for (auto x: s) cout << x << " "; cout << endl;
  }
  cout << result << endl;
  return 0;
}