Problem: For a dictionary $M$ that stores elements formed by a pair of a string key and an integer value, perform a sequence of the following operations. Note that each key in $M$ must be unique.

* insert($key$, $x$): Insert an element formed by a pair of $key$ and $x$ to $M$.
* get($key$): Print the value with the specified $key$. Print 0 if there is no such element.
* delete($key$): Delete the element with the specified $key$.
* dump($L$, $R$): Print all elements formed by a pair of the key and the value such that the key is greater than or equal to $L$ and less than or equal to $R$ in lexicographic order.

Constraints

* $1 \leq q \leq 200,000$
* $1 \leq x \leq 1,000,000,000$
* $1 \leq $ length of $key$ $ \leq 20$
* $key$ consists of lower-case letters
* $L \leq R$ in lexicographic order
* The total number of elements printed by dump operations does not exceed $1,000,000$

Input

The input is given in the following format.


$q$
$query_1$
$query_2$
:
$query_q$


Each query $query_i$ is given by


0 $key$ $x$


or


1 $key$


or


2 $key$


or


3 $L$ $R$


where the first digits 0, 1, 2 and 3 represent insert, get, delete and dump operations.

Output

For each get operation, print the corresponding value.
For each dump operation, print the corresponding elements formed by a pair of the key and the value. For the dump operation, print the elements (a pair of key and value separated by a space character) in ascending order of the keys.

Example

Input

9
0 blue 4
0 red 1
0 white 5
1 red
1 blue
2 red
1 black
1 red
3 w z


Output

1
4
0
0
white 5

Solution (in CPP):

Solution:
#include <algorithm>
#include<iostream>
#include<vector>
#include<deque>
#include<queue>
#include<list>
#include<stack>
#include<map>
#include<set>
#include<string>
#include <sstream>

#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<limits.h>

using namespace std;


int main(){
  long ii,jj,kk,q;
  map<string,int> m;
  int c,x;
  string key;
  //cout << "hoge" << endl;
  map<string,int>::iterator it;
  map<string,int>::iterator lit,rit;  
  cin >> q;


  for(ii=0;ii<q;ii++){
    cin >> c ;
    //cout << c << endl;
    if(c == 0){
      cin >> key >> x;
      //m.insert_or_assign(make_pair(key,x));
      m.erase(key);
      m.insert(make_pair(key,x));
    }
    else if(c==1){
      cin >> key;

      it = m.find(key);

      //cout << key << endl;
      if(it != m.end()){
          cout << m[key] << endl;
      }
      else{
        cout << 0 << endl;
      }


    }
    else if(c==2){
      cin >> key;
      m.erase(key);
    }
    else if(c==3){
      string l,r;
      pair<string,int> p;
      cin >> l >> r;

      it = m.lower_bound(l);
      
      while(it != m.end()){
        p = *it;
        if(p.first >= l && p.first <= r){
          cout << p.first << " " << p.second << endl;
        }
        if(p.first > r){
          break;
        }
        it++;
      }
    }
    //cout << key << endl;
  }

  
  return 0;
  
}