#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { ll n; cin >> n; ll a[n+1] = {}; srep(i,1,n+1)cin >> a[i]; ll keep = 0; drep(i,n+1){ if(i==0) break; a[i] += keep; if(a[i] % i != 0){ cout << "No" << endl; return 0; }else{ keep += a[i] / i; } } cout << "Yes" << endl; return 0; }