#include #define rep(i,n) for(int i = 0; i < (int)(n); i++) #define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--) #define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++) #define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--) #define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++) #define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++) #define ALL(x) x.begin(), x.end() using ll = long long; using namespace std; int main(){ int n; cin >> n; vector a(n); rep(i, n) cin >> a.at(i); rrep(i, n){ if(a.at(i) == 0){ a.pop_back(); }else{ break; } } ll rsum = 0; n = a.size(); rrep(i, n){ rsum += a.at(i); if(rsum % (i+1) != 0){ cout << "No" << endl; return 0; } } cout << "Yes" << endl; return 0; }