#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
#include <tuple>
#include <ranges>
namespace ranges = std::ranges;
namespace views = std::views;
// #include "Src/Number/IntegerDivision.hpp"
// #include "Src/Utility/BinarySearch.hpp"
// #include "Src/Sequence/CompressedSequence.hpp"
// #include "Src/Sequence/RunLengthEncoding.hpp"
// #include "Src/Algebra/Group/AdditiveGroup.hpp"
// #include "Src/DataStructure/FenwickTree/FenwickTree.hpp"
// #include "Src/DataStructure/SegmentTree/SegmentTree.hpp"
// #include "Src/DataStructure/DisjointSetUnion/DisjointSetUnion.hpp"
// using namespace zawa;
// #include "atcoder/modint"
// using mint = atcoder::modint998244353;
using namespace std;

int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    int N;
    cin >> N;
    vector<long long> A(N + 1);
    for (int i = 0 ; i <= N ; i++) cin >> A[i];
    long long sum = 0LL;
    for (int i = 0 ; i <= N ; i++) {
        sum += A[i] * i;
    }
    long long sum2 = accumulate(A.begin(), A.end(), 0LL);
    // sum2 -= A[0];
    if (sum % 2) {
        long long add = N % 2 == 0 ? N + 1 : N + 2;
        sum += add;
        sum2++;
        assert(sum % 2 == 0);
    }
    cout << (2LL * sum2 - 2 >= sum ? "Yes\n" : "No\n");
}