//
// Created by yamunaku on 2021/03/07.
//

#include <bits/stdc++.h>
//#include <atcoder/all>

using namespace std;
//using namespace atcoder;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD9 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

void solve() {
    int n;
    cin >> n;
    vector<string> s(3);
    rep(i, 3) cin >> s[i];
    cout << "1" + string(n, '0') + string(n, '1') << endl;
}

int main() {
    //CFS;
    int t;
    cin >> t;
    rep(_, t) solve();
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pp pop_back
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define f0(i,a,n) for(i=a;i<n;i++)
#define f1(i,a,b) for(i=a;i<=b;i++)
#define all(v) sort(v.begin(),v.end());
#define stp setprecision
#define nl endl
#define I insert
#define ipt(a,n) for(i=0;i<n;i++)cin>>a[i];
#define pll pair<ll,ll>
#define pii pair<int,int>
#define vl vector<ll>
#define mp map<ll,ll>
#define sr(a,n) sort(a,a+n);
#define cx(x) cout<<x<<"\n";
#define cy(x) cout<<x<<" ";
#define cn cout<<"No\n";
#define cw cout<<"Yes\n";
#define bs binary_search
#define S second
#define F first
#define pi 3.141592653589793238
#define ct cout<<
ll sieve[1000001];
void prime()
{
    ll i,j;
    sieve[0]=0,sieve[1]=0;
    for(i=2;i<=1e6;i++)
        sieve[i]=1;
    for(i=2;i<=1e6;i++)
    {
        if(sieve[i]==1)
        {
            for(j=2*i;j<=1e6;j+=i)
                sieve[j]=0;
        }
    }
}
ll be(ll a,ll b,ll m)
{
    ll r=1;
    while(b!=0)
    {
        if(b&1)
            r=(r*a)%m;
        a=(a*a)%m;
        b=b/2;
    }
    return r;
}
int main()
{
    fast;
    prime();
    ll t=1;
    //cin>>t;
    while(t--)
    {
        ll n,s,d,i;
        cin>>n>>s>>d;
        ll x[n],y[n],ans=0,k=0;
        f0(i,0,n)
        {
            cin>>x[i]>>y[i];
            k=0;
            if(x[i]<s&&y[i]>d)
            {
                ans=1,k=1;
            }
            //cx(k)
        }
        if(ans)
            cw
        else
            cn
    }
}