#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    int n;
    cin>>n;
    vector<ll> a(n+1);
    for(int i=1; i<=n; i++) cin>>a[i];
    while(a.back()==0) a.pop_back();
    n=(int)a.size()-1;
    ll s=0;
    for(int i=n; i>=1; i--){
        if((a[i]+s)%i!=0){
            cout<<"No"<<endl;
            return 0;
        }
        s+=(a[i]+s)/i;
    }
    cout<<"Yes"<<endl;
    return 0;
}