#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep(i, n) repr(i, 0, n) #define INF 2e9 //#define MOD 1000000007 #define MOD 998244353 #define LINF (long long)4e18 #define jck 3.141592 const double EPS = 1e-10; using ll = long long; using Pi = pair; using Pl = pair; int main(){ int n; cin >> n; vector a(n); rep(i,n) cin >> a[i]; ll cnt = 0; for(int i = n-1; i >= 0; i--){ if(a[i] != 0){ for(int j = i; j >= 0; j--){ if((a[j]+cnt)%(j+1) != 0){ cout << "No" << endl; return 0; } cnt += (a[j]+cnt)/(j+1); } break; } } cout << "Yes" << endl; }