/*#include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include //fixed,setprecision #include //INT_MAX #include //M_PI #include #include */ #include using namespace std; #include using namespace atcoder; //using mint = modint1000000007; using mint = modint998244353; //std::chrono::time_point start; template bool chmax(T &u, const T z) { if (u < z) {u = z; return true;} else return false; } template bool chmin(T &u, const T z) { if (u > z) {u = z; return true;} else return false; } #define ll long long #define rep(i, n) for (ll i = 0; i < (ll)(n); i++) typedef pair P; using vi=vector; using vvi=vector; ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; } ll lcm(ll a, ll b){return a * b / gcd(a, b);} template //contain(string s,string v) sにvが含まれるかを判定 bool contain(const std::basic_string& s, const U& v) { return s.find(v) != std::basic_string::npos; } const int mod=1000000007; struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; return fact[n]*ifact[k]*ifact[n-k]; } }; int main(){ int n; cin>>n; vectora(n),b(n); rep(i,n)cin>>a[i]; rep(i,n)cin>>b[i]; int start=-1; vector>ans_l,ans_r; rep(i,n){ if(a[i]==b[i])continue; else if(a[i]>kotae_l,kotae_r; if(ans_l.size()==0&&ans_r.size()==0)cout<<0<(ans_l[i])+1; int num=get<1>(ans_l[i]); char muki=get<2>(ans_l[i]); rep(j,num){ //cout<(ans_r[i])+1; int num=get<1>(ans_r[i]); char muki=get<2>(ans_r[i]); rep(j,num){ //cout<