//
//  main.cpp
//  zad1
//
//  Created by Karol on 16/04/2019.
//  Copyright © 2019 Karol. All rights reserved.
//

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <utility>
#include <vector>
#include <map>
#include <queue>
#include <string>
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define REP(i,n) for(int i=0;i<(n);i++)
#define REPT(i,a,b) for(int i=(a);i<=(b);i++)
using namespace std;
const int MXN=3e5+5;
inline void fastcin(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
}
int tab[MXN],tab1[MXN],n,t[MXN][2],nr;
deque<int>kolejka;
inline void czysc(){
    while(!kolejka.empty())kolejka.pop_back();
}
inline void zamien(int a){
    czysc();
    while(a>0){
        if(a%2==1)kolejka.push_front(1);
        else kolejka.push_front(0);
        a/=2;
    }
    while(kolejka.size()<30){
        kolejka.push_front(0);
    }
}
inline void dodaj(int a){

    nr++;

}
int main(){
    fastcin();
    cin>>n;
    REP(i,n){
        cin>>tab[i];
    }
    REP(i,n){
        cin>>tab1[i];
    }
}