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 <bits/stdc++.h>
using namespace std;
using ll = long long;
using vecll = vector<long long>;
#define all(c) (c).begin(), (c).end()
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)

int main()
{
    ll q, que, x, y;
    multiset<ll> S;
    cin >> q;

    rep(i, q)
    {
        cin >> que >> x;
        if (que == 0)
            S.insert(x);
        else if (que == 2)
        {
            S.erase(x);
            continue;
        }
        else if (que == 3)
        {
            cin >> y;
            //delctype(S)
            multiset<ll>::iterator first_itr = S.lower_bound(x);
            multiset<ll>::iterator end_itr = S.upper_bound(y);

            for (auto i = first_itr; i != end_itr; ++i)
                cout << *i << endl;

            /*for (int i = x; i <= y; i++)
            {
                if (S.find(i) != S.end())
                {
                    cout << *S.find(i) << endl;
                }
            }*/

                /*for(struct { ll i; int j;} s = { x, 0} ; s.i <= y ; ++s.i , ++s.j)
            {
                if (S.find(s.i) != S.end())
                {
                    //cout << (s.j ? " " : "");
                    cout << *S.find(s.i) << endl;
                }
            }*/
                continue;
        }

        cout << (que ? S.count(x) : S.size()) << endl;
    }
    return 0;
}
