// https://www.youtube.com/watch?v=wthasN45KuY
// You said I’d fly away
// But my walls have kept me down
// Now I’m lost and I’m afraid
// And I’m close to hit the ground
// 
// You said I’d fly away
// You said I’d fly anywhere
// But I keep on Falling

#ifndef ONLINE_JUDGE
#include "templates/debug.hpp"
#else
#define debug(...)
#endif

#include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
using u64 = uint64_t;

#define int i64
constexpr int INF = 1e9 + 7;
void solve() {
    int n; cin >> n;
    vector<int> a(n + 1), vis(n + 1);
    vector<int> first_pos, first_num;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        if (!vis[a[i]]) {
            vis[a[i]] = 1;
            first_pos.push_back(i);
            first_num.push_back(a[i]);
        }
    }
    if (ranges::count(a, a[1]) == n) {
        cout << "NO\n"; return;
    }
    vector<int> p(n + 1);
    set<int> unused;
    for (int i = 1; i <= n; i++) unused.insert(i);
    int m = first_pos.size();
    for (int i = 0; i < m; i++) {
        p[first_pos[(i + 1) % m]] = first_num[i];
        unused.erase(first_num[i]);
    }
    for (int i = 1; i <= n; i++) {
        if (!p[i]) {
            p[i] = *unused.begin();
            unused.erase(p[i]);
        }
    }
    cout << "YES\n";
    for (int i = 1; i <= n; i++) cout << p[i] << " ";
    cout << "\n";
}
#undef int

// Make bold hypotheses and verify carefully
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}