//デバッグ用オプション:-fsanitize=undefined,address //コンパイラ最適化 #pragma GCC optimize("Ofast") //インクルードなど #include //#include using namespace std; //using namespace atcoder; namespace { typedef long long ll; using vint = vector; using vll = vector; using vbool = vector; using vs = vector; using P = pair; using vp = vector

; template using arr = vector>; //マクロ #define REP(i, n) for (ll i = 0; i < ll(n); i++) #define REPD(i, n) for (ll i = n - 1; i >= 0; i--) #define FOR(i, a, b) for (ll i = a; i < ll(b); i++) #define FORD(i, a, b) for (ll i = a; i >= ll(b); i--) #define FORA(i, I) for (const auto &i : I) #define ALL(x) x.begin(), x.end() #define SIZE(x) ll(x.size()) #define INF 100000000000000 template bool chmax(T &a, const T &b) { if (a < b) { a = b; // aをbで更新 return true; } return false; } template bool chmin(T &a, const T &b) { if (a > b) { a = b; // aをbで更新 return true; } return false; } template void pl(T x) { cout << x << " "; } template void pr(T x) { cout << x << endl; } template void prvec(const vector &a) { REP(i, a.size() - 1) { cout << a[i] << " "; } pr(a[a.size() - 1]); } template void prarr(const arr &a) { REP(i, a.size()) if (a[i].empty()) pr(""); else prvec(a[i]); } template pair operator+(const pair &l, const pair &r) { return {l.first + r.first, l.second + r.second}; } template pair operator-(const pair &l, const pair &r) { return {l.first - r.first, l.second - r.second}; } template pair operator*(const pair &l, const T &r) { return {l.first * r, l.second * r}; } template pair operator/(const pair &l, const T &r) { return {l.first / r, l.second / r}; } template istream &operator>>(istream &is, vector &vec) { for (auto &v : vec) is >> v; return is; } template ostream &operator<<(ostream &os, const vector &vec) { os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const deque &vec) { os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; } template ostream &operator<<(ostream &os, const set &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_set &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const multiset &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_multiset &vec) { os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; } template istream &operator>>(istream &is, pair &pa) { is >> pa.first >> pa.second; return is; } template ostream &operator<<(ostream &os, const pair &pa) { os << "(" << pa.first << "," << pa.second << ")"; return os; } template istream &operator>>(istream &is, tuple &theTuple) { apply([&is](Ts &...tupleArgs) { ((is >> tupleArgs), ...); }, theTuple); return is; } template ostream &operator<<(ostream &os, const tuple &theTuple) { apply([&os](const Ts &...tupleArgs) { os << '('; size_t n(0); ((os << tupleArgs << (++n < sizeof...(Ts) ? "," : "")), ...); os << ')'; }, theTuple); return os; } template ostream &operator<<(ostream &os, const map &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template ostream &operator<<(ostream &os, const unordered_map &mp) { os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } // template void for_enum(T &container, std::function op) { int idx = 0; for (auto &value : container) { if (!op(idx++, value)) { break; } } } template map group_by(T &container, std::function op) { map grouped; for (auto &value : container) { grouped[op(value)].push_back(value); } return grouped; } template Container fmap(const Container &c, Transform f) { Container r; r.reserve(c.size()); transform(ALL(c), back_inserter(r), f); return r; } template Container ffilter(const Container &c, Predicate f) { Container r; std::copy_if(ALL(c), back_inserter(r), f); return r; } template InitialT freduce(const Container &c, InitialT v, BinaryOp op) { return accumulate(ALL(c), v, op); } } // namespace // const P udlr[4] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}}; struct Constants { ll N; Constants() { cin >> N; } } C; struct Args { vll a; vll ids; Args() : a(C.N - 1), ids(C.N - 1, 0) { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> a; for_enum(ids, [](int i, ll &x) { x = i; return true; }); sort(ALL(ids), [&](ll l, ll r) { return a.at(l) < a.at(r); }); // sort(ALL(a)); } } args; struct Solver { bool bans; vll ans; Solver() : bans(true), ans(C.N - 1, 0) { } // void solve() { REP(i, C.N - 1) { ll id = args.ids.at(i); ll value = args.a.at(id); if (i + 1 < value) { bans = false; return; } else { ans.at(i) = (i + 1 - value) + 1; } } } // void output() { if (!bans) { pr("NO"); } else { pr("YES"); FORA(a, ans) pr(a); } } } s; int main() { s.solve(); s.output(); return 0; }