#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;

bool solve(int n, const vector<int64_t>& a) {
    int64_t b = 0;
    REP_R (i, n) {
        if (a[i] > i + 1) return false;
        if ((a[i] + b) % (i + 1) != 0) return false;
        b += (a[i] + b) / (i + 1);
    }
    return true;
}

// generated by online-judge-template-generator v4.6.0 (https://github.com/online-judge-tools/template-generator)
const string YES = "Yes";
const string NO = "No";
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    constexpr char endl = '\n';
    int N;
    cin >> N;
    vector<int64_t> A(N);
    REP (i, N) { cin >> A[i]; }
    auto ans = solve(N, A);
    cout << (ans ? YES : NO) << endl;
    return 0;
}