// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#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 ll long long
#define ull unsigned 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 1000000009
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;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#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 10005
#define inf 0x3f3f3f3f

int n,d;
modint x[maxn],y[maxn];
pair<modint,modint>tmp[maxn];
modint now[maxn];
int cnt;

modint f[maxn];
namespace F{

int l=0;
modint x[maxn],y[maxn],a[maxn];
int n;
void mul(modint b){
	++l,a[l]=0;
	Rep(i,l,1)a[i]=a[i]*b+a[i-1];
	a[0]*=b;
}
void div(modint b){
	modint iv=1/b;
	a[0]*=iv;
	For(i,1,l)a[i]-=a[i-1],a[i]*=iv;
	--l; 
}
void wk(){
	l=0,a[l]=1;
	memset(a,0,sizeof a);
	a[l]=1;
	memset(f,0,sizeof f);
//	For(i,1,n)cout<<x[i].x<<" "<<y[i].x<<"\n"; cout<<"----\n";
	For(i,1,n)mul(-x[i]);
	For(i,1,n){
		modint coef=1;
		For(j,1,n)if(i!=j)coef*=x[i]-x[j];
		coef=y[i]/coef;
		div(-x[i]);
		For(j,0,n-1)f[j]+=a[j]*coef;
		mul(-x[i]);
	}
//	For(i,0,n+1)cout<<f[i].x<<" ";cout<<"\n";
}

}

modint res[maxn],res2[maxn];

void work()
{
	n=read();
	For(i,1,n)x[i]=read();
	For(i,1,n)y[i]=read();
	For(i,1,n)For(j,i+1,n)
		if((x[i]*x[j]).x==1){
			if(y[i].x||y[j].x)
				tmp[++cnt]=mkp(x[i],y[i]/y[j]);
		}
	if(!cnt) d=n*2;
	else{
		d=-1;
		For(i,1,cnt)now[i]=1;
		For(i,0,10000){
			bool ok=1;
			For(j,1,cnt){
				if(now[j].x==tmp[j].se.x);
				else ok=0;
				now[j]*=tmp[j].fi;
			}
			if(ok){
			//	cout<<"ok "<<d<<"\n";
				d=i;
			//	break;
			}
		}
		if(d==-1)return puts("-1"),void();
	}
	cerr<<"D "<<d<<"\n";
	bool hav0=0;
	modint y0=1;
	map<modint,modint>mp;
	For(i,1,n){
		if(x[i].x==0){
			hav0=1;
			y0=y[i];
			if(!y0.x)return puts("-1"),void();
			continue;
		}
		mp[x[i]]=y[i];
		modint t=1/x[i];
	//	if(mp.count(t)) cerr<<"qwq "<<mp[t].x<<" "<<(y[i]*(x[i]^(mod-1-d))).x<<"\n";
		mp[1/x[i]]=y[i]*(x[i]^(mod-1-d));
	}
	
	F::n=0;
	for(auto it:mp) ++F::n,F::x[F::n]=it.fi,F::y[F::n]=it.se;
	F::wk();
	
	For(i,d+1,10000)
		if(f[i].x)return puts("-1"),void();
	For(i,0,d) res[i]=(f[i]+f[d-i])*((mod+1)/2);
//	For(i,0,d) cout<<res[i].x<<" "; cout<<"\n";
	if((hav0 && res[0].x!=y0.x) || (!hav0 && res[0].x==0)){
		modint add=y0-res[0];
		For(i,d+1,10000)
			if(F::a[i].x)return puts("-1"),void();
		For(i,0,d)
			res2[i]=(F::a[i]+F::a[d-i])*((mod+1)/2);
		add/=res2[0];
		For(i,0,d) res[i]+=res2[i]*add;
	}
	cout<<d<<"\n";
	For(i,0,d) cout<<res[i].x<<" "; cout<<"\n";
}

signed main()
{
	int T=read();
	while(T--)work();
    return 0;
}
/*

*/