#include <bits/stdc++.h>
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve() {
	int n; cin >> n;
	vector<int> p(n); map<int, int> cnt;
	for (int i = 0; i < n; i++) {
		cin >> p[i]; cnt[p[i]]++;
		if (cnt[p[i]] == n) {
			cout << "NO\n";
			return;
		}
	}

	int mx = 0;
	for (int i = 1; i <= n; i++) {
		if (cnt[i] > cnt[mx]) mx = i;
	}

	vector<int> ans(n);
	for (int i = 0; i < n; i++) {
		ans[i] = i+1;
	}

	vector<int> p1;
	for (int i = 0; i < n; i++) {
		if (p[i] != mx) p1.push_back(i);
	}

	while (1) {
		random_shuffle(ans.begin(), ans.end());
		int pos1, pos2;
		for (int i = 0; i < n; i++) {
			if (ans[i] == mx) pos2 = i;
		}
		pos1 = p1[0];
		swap(ans[pos1], ans[pos2]);

		bool ok = 1;
		for (int i = 0; i < n; i++) {
			if (p[i] == ans[i]) {
				ok = 0; break;
			}
		}

		if (ok) {
			cout << "YES\n";
			for (int i: ans) cout << i << ' ';
				cout << '\n';
			return;
		}
	}
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0);
	
	int t; cin >> t;
	while (t--) {
		solve();
	}

	return 0;
}