#include <bits/stdc++.h>
#define rep(a,n) for (int a = 0; a < (n); ++a)
using namespace std;
using ll = long long;
typedef pair<int,int> P;
typedef pair<ll,P> PP;
typedef vector<vector<int> > Graph;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const ll INF = 1e18;

/*累積和
query(l,r)=引数に渡したvectorにおける[l,r)の和(0-indexed)
verified : https://judge.yosupo.jp/problem/static_range_sum
*/

template<typename T>
struct CumulativeSum{
    vector<T> res;
    CumulativeSum(const vector<T> vec){//初期化
        int sz = vec.size();
        res.resize(sz+1,0);
        for(int i=0;i<=sz;i++){
            res[i+1] = res[i]+vec[i];
        }
    }

    T query(int l, int r){
        return res[r]-res[l];
    }
};

int main(){
    ll n;
    cin >> n;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    CumulativeSum<ll>cum(a);
    for(int i=0;i<n;i++){
        if(cum.query(i,n)%(i+1)!=0){
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
    return 0;
}