1894B.cpp

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

#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>

#define f(i,s,e) for(long long int i=s;i<e;i++)

template <class T>
void print_v(vector<T> &v) { cout << "{"; for (auto x : v) cout << x << ","; cout << "\b}"; }

#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
ll min(ll a,int b) { if (a<b) return a; return b; }
ll min(int a,ll b) { if (a<b) return a; return b; }
ll max(ll a,int b) { if (a>b) return a; return b; }
ll max(int a,ll b) { if (a>b) return a; return b; }
ll gcd(ll a,ll b) { if (b==0) return a; return gcd(b, a%b); }
ll lcm(ll a,ll b) { return a/gcd(a,b)*b; }
string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; }
string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; }
bool prime(ll a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) if (a%i==0) return 0; return 1; }
void yes() { cout<<"YES\n"; }
void no() { cout<<"NO\n"; }

void solve() {

    int n;
    cin >> n;
    vector<int> v(n);
    vector<int> res(n);
    unordered_map<int,vector<int>> pl;
    int cnt = 0;

    for(int i=0; i<n; i++) {
        cin >> v[i];
        pl[v[i]].push_back(i);
    }

    for(auto it:pl) {
        if(it.second.size() > 1) cnt++;
    }
    
    if(cnt < 2) {
        cout << "-1" << endl; return;
    }

    bool prev = true;

    for(auto it:pl) {
        int times = it.second.size();
        for(int k=0; k<times; k++) {
            res[it.second[k]] = 1;
        }
        if(times > 1) {
            if(prev) {
                res[it.second[0]] = 3;
                prev = false;
            }else{
                res[it.second[0]] = 2;
            }
        }
    }

    for(auto i : res) cout << i << " ";
    cout << endl;


}

int main()
{

    int t;
    cin >> t;

    while(t--){
        solve();
    }
    return 0;

}