#include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cout;
using std::cerr;
using std::endl;
using std::cin;

template<typename T>
std::vector<T> make_v(size_t a){return std::vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

int main() {
	int n; scanf("%d", &n); std::vector<int> a(n);
	for(int i = 0; i < n; i++) scanf("%d", &a[i]);

	// prepare
	std::vector<std::pair<int, int>> vec;
	for(int i = 0; i < n; i++) vec.push_back({a[i], i});
	sort(begin(vec), end(vec)); reverse(begin(vec), end(vec));

	// solve
	if(a.back() == 1) {
		printf("No\n");
		return 0;
	}

	int bound = a.back();
	std::vector<int> ans;
	for(int i = n; i > bound; i--) ans.push_back(i);
	for(int i = n - 1; i >= 0; i--) {
		if(a[i] >= bound) continue;

		ans.push_back(a[i]);
	}
	
	printf("Yes\n");
	for(auto v: ans) printf("%d ", v);
	printf("\n");
	return 0;
}