D. Cyclic Rotation

 

 

 

#include <bits/stdc++.h>
#define endl '\n'

using namespace std;

typedef long long ll;
typedef pair<int,int>PII;

const int N=200010;

int t,n,m;
int a[N],b[N];
map<int,int>st;

void solve()
{
	cin>>n;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=n;i++)cin>>b[i];
	st.clear();
	int i=1,j=1;
	while(1)
	{
		if(i==n+1||j==n+1)
		{
			if(i==n+1&&j==n+1)cout<<"YES"<<endl;
			else cout<<"NO"<<endl;
			return ;
		}
		if(i<=n&&a[i]!=b[j])
		{
			st[a[i]]++;
			i++;
			continue;
		}
		if(st[b[j]])
		{
			st[b[j]]--;
			j++;
		}
		else i++,j++;
		
	}
	
}

int main()
{
	cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);
	cin>>t;
	while(t--)
	{
		solve();
	}
	return 0;
 }