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<bits/stdc++.h>
using namespace std;
#define     ll              long long
#define     MAX             100000
#define     FI              freopen("input.txt","r",stdin)
#define     FO              freopen("output.txt","w",stdout)
#define     fast            ios_base::sync_with_stdio(false);cin.tie();cout.tie();
#define     sc(a)           scanf("%d",&a)
#define     sc2(a,b)        scanf("%d %d",&a,&b)


map<string,int>SMS;
map<string,int>::iterator it;


int main()
{
   // FI;
    int test;
    scanf("%d",&test);
    while(test--)
    {
        int cs;
        scanf("%d",&cs);
        switch(cs)
        {
        case 0:
            {
                string s;
                int a;
                cin>>s>>a;
                SMS[s]=a;
            }
            break;
        case 1:
            {
                string s;
                cin>>s;
                it = SMS.find(s);
                cout<<it->second<<"\n";
            }
            break;
        case 2:
            {
                string s;
                cin>>s;
                SMS.erase(s);
            }
            break;
        case 3:
            {
                string a,b;
                cin>>a>>b;
                it = SMS.lower_bound(a);
                for(;it!=SMS.upper_bound(b);it++)
                    cout<<it->first<<" "<<it->second<<"\n";
            }
            break;
        default:
            break;
        }
    }
    return 0;
}


