#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

int main() {
    cin >> n;
    for (int i = 0; i < n + 1; i++) scanf("%d", w + i);
    ll sum = 0;
    for (int i = 1; i < n + 1; i++) res -= w[i] * (ll)i, sum += w[i];
    if (sum) res += (sum - 1) << 1;
    puts(res >= 0 && res % 2 == 0 ? "Yes" : "No");
    return 0;
}