#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
// using namespace atcoder;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)a[i] = i;
	vector<int>b(n);
	rep(i, n)cin >> b[i], b[i]--;
	vector<int>ans;
	rep(i, n) {
		int pos = 0;
		rep(j, n)if (b[i] == a[j])pos = j;
		rrep2(j, i, pos) {
			ans.push_back(j);
			swap(a[j], a[j + 1]);
		}
	}
	cout << "Yes" << endl;
	cout << ans.size() << endl;
	for (auto e : ans)cout << e + 1 << " ";
	cout << endl;
	return 0;
}