#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0; i<(n); i++)
#define rep2(i,x,n) for(int i=x; i<(n); i++)
#define all(x) x.begin(),x.end()
typedef long long ll;
ll mod = 1000000007;
ll inf = 1e18;
int main(){

    int n;
    cin >> n;
    vector<ll> a(n+1);
    rep(i,n) cin >> a[i+1];

    ll count=0;
    bool ans=true;
    for(int i=n; i>=1; i--){
        if(a[i]+count==0) continue;
        if((a[i]+count)%i==0 && a[i]<=i) count+=(a[i]+count)/i;
        else ans=false;
    }

    if(ans) cout << "Yes" << endl;
    else cout << "No" << endl;

    
    return 0;
}