#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    int n;
    cin >> n;
    vector<int> a(n+1);
    cin >> a;

    ll ale = 0;
    rep(i, n+1) ale += a[i] * ll(i);
    if(ale&1) {
        if(n&1) {
            n += 2;
            a.push_back(0);
            a.push_back(1);
        } else {
            n++;
            a.push_back(1);
        }
        ale += n;
    }

    ll e = 2;
    bool ok = false;
    repd(i, n+1, 2) {
        if(a[i] > 0) ok = true;
        e = e + a[i] * ll(i - 2);
    }
    if(!ok) {
        cout << "Yes" << endl;
        return 0;
    } else {
        cout << (e <= a[1] ? "Yes" : "No") << endl;
    }
    return 0;
}