#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define int long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
};
inline modint qpow(modint x,int y){return x^y;}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,a[maxn],res[maxn],b[maxn];
bool vis[maxn];
vi p[maxn];
bool cmp(int x,int y){
	return p[x].size()>p[y].size(); 
}
signed main()
{
	int T=read();
	while(T--){
		n=read();
		For(i,1,n)a[i]=read(),b[i]=i,p[i].clear(),vis[i]=0;
		int mx=0;
		For(i,1,n)p[a[i]].pb(i),mx=max(mx,(int)p[a[i]].size());
		if(mx==n){
			puts("NO");
			continue;
		}
		sort(b+1,b+n+1,cmp);
		vi o;
		Rep(i,n,1){
			int v=b[i];
			if(p[v].size()){
				int t=p[v].back(); p[v].pop_back();
				res[t]=b[1]; vis[t]=1; 
				break;
			}
		}
		o=p[b[1]];
		For(i,2,n){
			assert(o.size()>0);
			res[o.back()]=b[i]; o.pop_back();
			for(auto t:p[b[i]]) if(!vis[t]) o.pb(t);
		}puts("YES");
		For(i,1,n) cout<<res[i]<<' '; puts("");
	}
	return 0;
}