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
#include <iostream>
#include <stdio.h>
#include <string>
#include <map>

using namespace std;

int main()
{
    map<string, int> M;
    int query, command, value;
    string key, L, R;
    map<string, int>::iterator itr, itrlow, itrup;
    scanf("%d", &query);
    for (int i = 0; i < query; i++)
    {
        scanf("%d", &command);
        switch (command) {
        case 0:
            cin >> key >> value;
            M[key] = value;
            break;
        case 1:
            cin >> key;
            if (M.find(key) == M.end())
            {
                printf("%d\n", 0);
            }
            else
            {
                printf("%d\n", M[key]);
            }

            break;
        case 2:
            cin >> key;
            M.erase(key);
            break;
        case 3:
            cin >> L >> R;
            itrlow = M.lower_bound(L);
            itrup = M.upper_bound(R);
            while (itrlow != itrup) {
                cout << itrlow->first << " " << itrlow->second << "\n";
                itrlow++;
            }

        default:
            break;
        }
    }
    return 0;
}


// erasing from map
#include <iostream>
#include <map>
#include <string>

int main1()
{
  map<string, int> map1;
  map<string, int>::iterator itr;
  string str1 = "aaa";
  string str2 = "bbb";
  string str3 = "ccc";
  map1[str1] = 10;
  map1[str2] = 20;
  map1[str3] = 30;
  map1.erase(str1);
  for (itr=map1.begin(); itr!=map1.end(); ++itr)
    std::cout << itr->first << " => " << itr->second << '\n';

  return 0;
}

