#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    vector<ll> A(N + 1);
    
    bool zero = true;
    for (int i = 0; i <= N; i++)
    {
        cin >> A[i];
        zero &= (A[i] == 0);
    }

    if (zero)
    {
        cout << "Yes" << endl;
        return 0;
    }

    while (A[A.size() - 1] == 0)
    {
        A.pop_back();
    }

    N = (int)A.size() - 1;

    if (N >= 2)
    {
        ll S = 0, T = 0;
        for (int i = 2; i <= N; i++)
        {
            S += (i - 1) * A[i];
            T += A[i];
        }

        ll d1 = 2 + S - T;
        if ((A[1] - d1) >= 0 && (A[1] - d1) % 2 == 0)
        {
            cout << "Yes" << endl;
        }
        else
        {
            cout << "No" << endl;
        }
    }
    else if (N == 1)
    {
        if (A[1] % 2 == 0)
        {
            cout << "Yes" << endl;
        }
        else
        {
            cout << "No" << endl;
        }
    }
    else if (N == 0)
    {
        cout << "Yes" << endl;
    }
}