#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main () {
	int N;
	cin >> N;
	std::vector<ll> A(N+1);
	for (ll& a : A) cin >> a;
	ll max_d = 0, min_d = 2;;
	for (ll i = 2; i <= N; i ++) {
		max_d += A[i] * i;
		min_d -= A[i] * 2;
	}
	min_d += max_d;
	min_d = min(min_d, max_d);
	if (A[1] < min_d) {
		puts("No");
	} else if ((A[1] + min_d) & 1) {
		ll x = (N + 1) + (1 ^ ((N + 1) & 1));
		cout << (A[1] >= min_d + x ? "Yes" : "No") << endl;
	} else {
		puts("Yes");
	}
}