For a set $S$ of integers, perform a sequence of the following operations. Note that multiple elements can have equivalent values in $S$.

* insert($x$): Insert $x$ to $S$ and report the number of elements in $S$ after the operation.
* find($x$): Report the number of $x$ in $S$.
* delete($x$): Delete all $x$ from $S$.
* dump($L$, $R$): Print elements $x$ in $S$ such that $L \leq x \leq R$.

Constraints

* $1 \leq q \leq 200,000$
* $0 \leq x \leq 1,000,000,000$
* The total number of elements printed by dump operations does not exceed $1,000,000$
* The sum of numbers printed by find operations does not exceed $2,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 $x$


or


1 $x$


or


2 $x$


or


3 $L$ $R$


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

Output

For each insert operation, print the number of elements in $S$.
For each find operation, print the number of specified elements in $S$.
For each dump operation, print the corresponding elements in ascending order. Print an element in a line.

Example

Input

10
0 1
0 1
0 2
0 3
2 2
1 1
1 2
1 3
0 4
3 1 4


Output

1
2
3
4
2
0
1
4
1
1
3
4
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <map>
#include <numeric>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <list>
#include <set>
#include <stack>
#include <cctype>
#include <cmath>

using namespace std;

/* typedef */

typedef long long ll;

/* constant */

const int INF = 1 << 30;
const int MAX = 10000;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */

/* function */
void printAns(bool can);

/* main */
int main(){
    int q, option, num, num2; 
    // multiset : multiple elements can have equivalent values in S
    multiset<int> S;
    using iterator = decltype(S)::iterator;
    cin >> q;
    for (int i  = 0; i < q; i++) {
        cin >> option >> num;
        // cout << option << ' ' << num << '\n';
        switch(option) {
        case 0: {
            // insert(x): Insert x to S 
            //            and report the number of elements 
            //            in S after the operation
            S.insert(num);
            cout << S.size() << '\n';
            break;
                }
        case 1: {
            // find(x): Report the number of x in S
            cout << S.count(num) << '\n';
            break;
            }
        case 2: {
            // delete(x): Delete all x from S
            // 1
            /*
            pair<iterator, iterator> ret = S.equal_range(num);
            for (iterator it = ret.first; it != ret.second; ) {
                it = S.erase(it);
            }
            */
            //2 
            S.erase(num);
            break;
            }
        case 3: {
            // dump(L, R): Print elements x in S 
            //             such that L <= x <= R
            cin >> num2;
            iterator cur = S.lower_bound(num);
            iterator last = S.upper_bound(num2);
            for (; cur != last ; cur++)
                cout << *cur << '\n';
            break;
            }
        }
    }
}


void printAns(bool can) {
    if (can) cout << 1 << '\n';
    else cout << 0 << '\n';
}

