#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()

vector<i64> A(202020,1e18),B(202020,1e18);
vector<i64> Ab(512,1e18),Bb(512,1e18);
vector<int> lazy(512,0);
const int Interval = 512;

int N;

const i64 INF = 1e18;

void LAZY(int s){
  if(lazy[s] == 0) return;
  if(lazy[s] == 1){Ab[s] = Bb[s];}
  if(lazy[s] == -1){Bb[s] = Ab[s];}
  for(int i = s * Interval;i < (s + 1) * Interval;i++){
    if(lazy[s] == 1){A[i] = B[i];}
    if(lazy[s] == -1){B[i] = A[i];}
  }
  lazy[s] = 0;
}

int main(){
  cin >> N;
  rep(i,0,N - 1) cin >> A[i];
  rep(i,0,N - 1) cin >> B[i];
  rep(i,0,N - 1) Ab[i/ Interval] = min(Ab[i / Interval] , A[i]);
  rep(i,0,N - 1) Bb[i/ Interval] = min(Bb[i / Interval] , B[i]);

  int Q;
  cin >> Q;
  rep(q,0,Q - 1){
    int x,y,z;
    cin >> x >> y >> z;
    if(x == 1){
      y--;
      LAZY(y / Interval);
      A[y] = z;
      int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
    }
    if(x == 2){
      y--;
      LAZY(y / Interval);
      B[y] = z;
      int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
    }
    if(x == 3){
      y--;
      i64 ans = A[y];
      int before = -1;
      while(y < z){
        if(y % Interval == 0 && y + Interval <= z){
          if(lazy[y / Interval] != 1) ans = min(ans , Ab[y / Interval]);
          else ans = min(ans , Bb[y / Interval]);
          y += Interval;
        }
        else{
          LAZY(y / Interval);
          if(before != y / Interval){
              int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
          }
          before = y / Interval;
          ans = min(ans , A[y]);
          y++;
        }
      }
      cout << ans << endl;
    }
    if(x == 4){
      y--;
      i64 ans = B[y];
      int before = -1;
      while(y < z){
        if(y % Interval == 0 && y + Interval <= z){
         if(lazy[y / Interval] != -1) ans = min(ans , Bb[y / Interval]);
          else ans = min(ans , Ab[y / Interval]);
          y += Interval;
        }
        else{
          LAZY(y / Interval);
          if(before != y / Interval){
              int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
          }
          before = y / Interval;
          ans = min(ans , B[y]);
          y++;
        }
      }
      cout << ans << endl;
    }
    if(x == 5){
      for(int i = 0;i < N / Interval + 1;i++){
        if(lazy[i] != -1) lazy[i] = 1;
      }
    }
    if(x == 6){
      for(int i = 0;i < N / Interval + 1;i++){
        if(lazy[i] != 1) lazy[i] = -1;
      }
    }
  }
}


### Prompt

Construct a Cpp code solution to the problem outlined:

Problem

Given two sequences of length $ N $, $ A $ and $ B $. First, the $ i $ item in the sequence $ A $ is $ a_i $, and the $ i $ item in the sequence $ B $ is $ b_i $.

Since a total of $ Q $ of statements of the following format are given, create a program that processes in the given order.

Each statement is represented by three integers $ x, y, z $.

* Set the value of the $ y $ item in the sequence $ A $ to $ z $. (When $ x = 1 $)
* Set the value of the $ y $ item in the sequence $ B $ to $ z $. (When $ x = 2 $)
* Find and report the smallest value in the $ z $ item from the $ y $ item in the sequence $ A $. (When $ x = 3 $)
* Find and report the smallest value in the $ z $ item from the $ y $ item in the sequence $ B $. (When $ x = 4 $)
* Change the sequence $ A $ to be exactly the same as the sequence $ B $. (When $ x = 5 $)
* Change the sequence $ B $ to be exactly the same as the sequence $ A $. (When $ x = 6 $)

Constraints

The input satisfies the following conditions.

* $ 2 \ le N \ le 2 \ times 10 ^ 5 $
* $ 2 \ le Q \ le 2 \ times 10 ^ 5 $
* $ 1 \ le a_i \ le 10 ^ 9 $
* $ 1 \ le b_i \ le 10 ^ 9 $
* $ 1 \ le x_i \ le 6 $
* $ 1 \ le y_i \ le N $ (when $ 1 \ le x_i \ le 4 $)
* $ y_i = -1 $ (when $ x_i = 5, 6 $)
* $ 1 \ le z_i \ le 10 ^ 9 $ (when $ x_i = 1, 2 $)
* $ y_i \ le z_i \ le N $ (when $ x_i = 3, 4 $)
* $ z_i = -1 $ (when $ x_i = 5, 6 $)
* All inputs are integers

Input

The input is given in the following format.

$ N $
$ a_ {1} $ $ a_ {2} $ ... $ a_ {N} $
$ b_ {1} $ $ b_ {2} $ ... $ b_ {N} $
$ Q $
$ x_1 $ $ y_1 $ $ z_1 $
$ x_2 $ $ y_2 $ $ z_2 $
...
$ x_Q $ $ y_Q $ $ z_Q $

Output

Every time a statement of $ x = 3 $ or $ x = 4 $ is given by input, the found value is output on one line.

Example

Input

5
1 3 5 7 9
6 2 3 2 6
10
1 3 4
3 4 5
4 2 3
5 -1 -1
2 3 8
3 2 5
4 3 3
1 1 1
6 -1 -1
3 1 5


Output

7
2
2
8
1

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i,s,e) for(int (i) = (s);(i) <= (e);(i)++)
#define all(x) x.begin(),x.end()

vector<i64> A(202020,1e18),B(202020,1e18);
vector<i64> Ab(512,1e18),Bb(512,1e18);
vector<int> lazy(512,0);
const int Interval = 512;

int N;

const i64 INF = 1e18;

void LAZY(int s){
  if(lazy[s] == 0) return;
  if(lazy[s] == 1){Ab[s] = Bb[s];}
  if(lazy[s] == -1){Bb[s] = Ab[s];}
  for(int i = s * Interval;i < (s + 1) * Interval;i++){
    if(lazy[s] == 1){A[i] = B[i];}
    if(lazy[s] == -1){B[i] = A[i];}
  }
  lazy[s] = 0;
}

int main(){
  cin >> N;
  rep(i,0,N - 1) cin >> A[i];
  rep(i,0,N - 1) cin >> B[i];
  rep(i,0,N - 1) Ab[i/ Interval] = min(Ab[i / Interval] , A[i]);
  rep(i,0,N - 1) Bb[i/ Interval] = min(Bb[i / Interval] , B[i]);

  int Q;
  cin >> Q;
  rep(q,0,Q - 1){
    int x,y,z;
    cin >> x >> y >> z;
    if(x == 1){
      y--;
      LAZY(y / Interval);
      A[y] = z;
      int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
    }
    if(x == 2){
      y--;
      LAZY(y / Interval);
      B[y] = z;
      int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
    }
    if(x == 3){
      y--;
      i64 ans = A[y];
      int before = -1;
      while(y < z){
        if(y % Interval == 0 && y + Interval <= z){
          if(lazy[y / Interval] != 1) ans = min(ans , Ab[y / Interval]);
          else ans = min(ans , Bb[y / Interval]);
          y += Interval;
        }
        else{
          LAZY(y / Interval);
          if(before != y / Interval){
              int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
          }
          before = y / Interval;
          ans = min(ans , A[y]);
          y++;
        }
      }
      cout << ans << endl;
    }
    if(x == 4){
      y--;
      i64 ans = B[y];
      int before = -1;
      while(y < z){
        if(y % Interval == 0 && y + Interval <= z){
         if(lazy[y / Interval] != -1) ans = min(ans , Bb[y / Interval]);
          else ans = min(ans , Ab[y / Interval]);
          y += Interval;
        }
        else{
          LAZY(y / Interval);
          if(before != y / Interval){
              int start = y - y % Interval;
      int end = start + Interval;
      end = min(end,N);
      Ab[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Ab[y / Interval] = min(Ab[y / Interval],A[i]);
      }
      Bb[y / Interval] = INF;
      for(int i = start;i < end;i++){
        Bb[y / Interval] = min(Bb[y / Interval],B[i]);
      }
          }
          before = y / Interval;
          ans = min(ans , B[y]);
          y++;
        }
      }
      cout << ans << endl;
    }
    if(x == 5){
      for(int i = 0;i < N / Interval + 1;i++){
        if(lazy[i] != -1) lazy[i] = 1;
      }
    }
    if(x == 6){
      for(int i = 0;i < N / Interval + 1;i++){
        if(lazy[i] != 1) lazy[i] = -1;
      }
    }
  }
}


```