#include <iostream>
#include <vector>
using namespace std;
#define rep(i,a,b) for (int i=a; i<(b); ++i)
#define sz(x) (int) (x).size()
const int maxn = 100000;
int n;
int a[maxn];
vector<int> cnt[maxn+1];
vector<int> not_appear;
vector<int> single;
int b[maxn];
void solve() {
	cin >> n; 
	
	rep(i,1,n+1) cnt[i].clear();
	not_appear.clear();
	single.clear();
	
	for (int i=0; i<n; ++i) {
		cin >> a[i];
		cnt[a[i]].push_back(i);
	}
	
	rep(i,1,n+1) if (sz(cnt[i]) == 0) not_appear.push_back(i);
	else single.push_back(i);
	
	if (sz(single) == 1) {
		cout << "NO\n";
		return;
	}
	
	int ptr = 1;
	for (auto u: not_appear) {
		int p = -1;
		while (ptr<=n) {
			if (sz(cnt[ptr]) > 1) {
				p = cnt[ptr].back(); cnt[ptr].pop_back();
				break;
			} else ptr++;
		}
		b[p] = u;
	}
	rep(i,0,sz(single)) {
		int r = single[(i+1)%sz(single)];
		b[cnt[r][0]] = single[i];
	}
	
	cout << "YES\n";
	rep(i,0,n) cout << b[i] << ' ';
	cout << '\n';
}
	
int main() {
	ios_base::sync_with_stdio(0);
	int t; cin >> t;
	rep(i,0,t) solve();
		
	return 0;
}