Problem: A bitstring is a string that contains only the characters 0 and 1.

Koyomi Kanou is working hard towards her dream of becoming a writer. To practice, she decided to participate in the Binary Novel Writing Contest. The writing prompt for the contest consists of three bitstrings of length 2n. A valid novel for the contest is a bitstring of length at most 3n that contains at least two of the three given strings as subsequences.

Koyomi has just received the three prompt strings from the contest organizers. Help her write a valid novel for the contest.

A string a is a subsequence of a string b if a can be obtained from b by deletion of several (possibly, zero) characters.

Input

The first line contains a single integer t (1 ≤ t ≤ 10^4) — the number of test cases.

The first line of each test case contains a single integer n (1 ≤ n ≤ 10^5).

Each of the following three lines contains a bitstring of length 2n. It is guaranteed that these three strings are pairwise distinct.

It is guaranteed that the sum of n across all test cases does not exceed 10^5.

Output

For each test case, print a single line containing a bitstring of length at most 3n that has at least two of the given bitstrings as subsequences.

It can be proven that under the constraints of the problem, such a bitstring always exists.

If there are multiple possible answers, you may output any of them.

Example

Input


2
1
00
11
01
3
011001
111010
010001


Output


010
011001010

Note

In the first test case, the bitstrings 00 and 01 are subsequences of the output string: 010 and 010. Note that 11 is not a subsequence of the output string, but this is not required.

In the second test case all three input strings are subsequences of the output string: 011001010, 011001010 and 011001010.

Solution (in CPP):

Solution:
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
#include <bits/stdc++.h>

#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(),(x).end()

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
typedef vector < int > VI;
typedef double D;

const int MN = 300005, inf = 1000000005, mod = 1000000007;
const LL INF = 1000000000000000005LL;

char A[MN], B[MN], C[MN];

vector < PII > co[5];

void solve()
{
	int n;
	scanf("%d", &n);
	int nn = 2 * n, nnn = 3 * n;
	scanf("%s%s%s", A + 1, B + 1, C + 1);
	int p1 = 1, p2 = 1, p3 = 1;
	co[0].clear();
	co[1].clear();
	co[2].clear();
	while(max(max(p1, p2), p3) <= nn)
	{
		if(A[p1] == B[p2])
		{
			co[0].pb({p1, p2});
			++p1;
			++p2;
		}
		else if(A[p1] == C[p3])
		{
			co[1].pb({p1, p3});
			++p1;
			++p3;
		}
		else
		{
			co[2].pb({p2, p3});
			++p2;
			++p3;
		}
	}
	string ans = "";
	int x = 1, y = 1;
	if((int)co[0].size() >= n)
	{
		for(auto p : co[0])
		{
			while(x < p.fi)
			{
				ans += A[x];
				++x;
			}
			while(y < p.se)
			{
				ans += B[y];
				++y;
			}
			ans += A[p.fi];
			x++;
			y++;
		}
		while(x <= nn)
			ans += A[x++];
		while(y <= nn)
			ans += B[y++];
	}
	else if((int)co[1].size() >= n)
	{
		for(auto p : co[1])
		{
			while(x < p.fi)
			{
				ans += A[x];
				++x;
			}
			while(y < p.se)
			{
				ans += C[y];
				++y;
			}
			ans += A[p.fi];
			x++;
			y++;
		}
		while(x <= nn)
			ans += A[x++];
		while(y <= nn)
			ans += C[y++];
	}
	else
	{
		assert((int)co[2].size() >= n);
		for(auto p : co[2])
		{
			while(x < p.fi)
			{
				ans += B[x];
				++x;
			}
			while(y < p.se)
			{
				ans += C[y];
				++y;
			}
			ans += B[p.fi];
			x++;
			y++;
		}
		while(x <= nn)
			ans += B[x++];
		while(y <= nn)
			ans += C[y++];
	}
	assert((int)ans.length() <= nnn);
	int diff = nnn - ans.length();
	while(diff > 0)
	{
		ans += '0';
		--diff;
	}
	printf("%s\n", ans.c_str());
}

int main()
{
	int t;
	scanf("%d", &t);
	while(t--)
		solve();
}