#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int N;
    cin >> N;
    using P = pair<int, int>;
    vector<P> opes;
    for(int i = 0; i < N - 1; ++i){
        int a;
        cin >> a;
        opes.emplace_back(a, i);
    }
    sort(begin(opes), end(opes));
    vector<int> ans(N - 1);
    for(int i = 0; i < N - 1; ++i){
        ans[opes[i].second] = i + 1 - opes[i].first;
        if(ans[opes[i].second] < 0){
            cout << "NO\n";
            return 0;
        }
    }
    cout << "YES\n";
    for(int i = 0; i < N - 1; ++i){
        cout << ans[i] + 1 << '\n';
    }

    return 0;
}