#include <iostream>
#include <vector>
#include <algorithm>
#include "math.h"
using namespace std;
int main(){
int N, a;
cin>>N;
vector<int> vec;
for(int i = 0; i < N; ++i){
    cin>>a;
    vec.push_back(a);
}
long long ans = vec[0] - 1;
int k = 2;
for(int i = 1; i < N; ++i){
    if(vec[i] > k){
        long long t = ceil(vec[i] / (double)k) - 1;
        ans += t;
    }
    else if(vec[i] == k){
        k++;
    }
}
cout<<ans<<endl;
return 0;
}
