#include <iostream>
#include <vector>

using lint = long long;

void solve() {
    int n;
    std::cin >> n;

    std::vector<lint> xs(n);
    for (auto& x : xs) std::cin >> x;
    xs.insert(xs.begin(), 0);

    lint sum = 0;
    for (int p = n; p >= 1; --p) {
        if (xs[p] > p || (xs[p] + sum) % p != 0) {
            std::cout << "No\n";
            return;
        }
        sum += (xs[p] + sum) / p;
    }

    std::cout << "Yes\n";
}

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

    solve();

    return 0;
}