#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 1;


void solve(){
    int n; cin >> n;
    vector<ll> a(n+1); for(int i=0; i<=n; i++) cin >> a[i];
    ll sum = 0LL, dsum = 0LL;
    for(int i=1; i<=n; i++){
        sum += a[i];
        dsum += (ll)i * a[i];
    }

    if(sum == 0LL){
        cout << "Yes\n";
        return;
    }

    if(dsum%2LL==0LL && dsum <= 2LL*sum-2LL){
        cout << "Yes\n";
    }else{
        ll sum2 = sum - a[0];
        ll dsum2 = dsum - a[0];
        if(a[0] < dsum2 - (2LL*sum2-2LL) - 1LL){
            cout << "No\n";
        }else{
            ll rest = a[0] - (dsum2 - (2LL*sum2-2LL) - 1LL);
            if(n < rest + 1LL) cout << "Yes\n";
            else cout << "No\n";
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}