//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
int pos[100100];
vector<int> gen(vector<int> vec)
{
	int n=sz(vec);
	if(n<=6)
	{
		vector<int> ret;
		for(int i=1;i<=n;i++)
			ret.pb(i);
		do
		{
			bool flag=1;
			for(int i=1;i<=n;i++)
				if(ret[i-1]==i||ret[i-1]==vec[i-1])
					flag=0;
			if(flag)
				return ret;
		}
		while(next_permutation(ALL(ret)));
		return {-1};
	}
	set<int> st;
	st.insert(n-1);
	st.insert(n);
	st.insert(vec[n-1]);
	st.insert(vec[n-2]);
	vector<int> ret(n,-1);
	set<int> st2;
	for(int i=1;i<=n;i++)
		st2.insert(i);
	for(int i=0;i<n;i++)
	{
		for(auto val:st)
			if(val!=i+1&&val!=vec[i])
			{
				ret[i]=val;
				st.erase(val);
				st2.erase(val);
				break;
			}
		if(ret[i]==-1)
		{
			for(auto val:st2)
				if(val!=i+1&&val!=vec[i])
				{
					ret[i]=val;
					st2.erase(val);
					break;
				}
		}
	}
	return ret;
}
int p[100100],q[100100];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		vector<int> vec;
		for(int i=1;i<=n;i++)
		{
			int x;
			cin>>x;
			vec.pb(x);
			pos[x]=i;
		}
		vector<int> ans=gen(vec);
		if(ans[0]==-1)
			cout<<"Impossible\n";
		else
		{
			cout<<"Possible\n";
			for(int i=1;i<=n;i++)
				cout<<(p[i]=pos[ans[i-1]])<<" ";
			cout<<endl;
			for(int i=1;i<=n;i++)
				pos[ans[i-1]]=i;
			for(int i=1;i<=n;i++)
				cout<<(q[i]=pos[i])<<" ";
			cout<<endl;
			for(int i=1;i<=n;i++)
				assert(vec[p[q[i]]-1]==i);
		}
	}
	return 0;
}