#include <iostream>
#include <iomanip>
#include<vector>
#include <algorithm>
#include <queue>
#include<string>
#include <map>
#include <cmath>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <utility>
#include <set>
typedef long long ll;
typedef long double ld;


#define REP(i,s,n)for(ll i=s;i<(n);++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
ll S[1000] = { 0 };
ll N,M,Q;


int main() {
	multiset<ll>A;
	cin >> Q;
	rep(i, Q) {
		ll a, b,c;
		cin >> a ;
		if (a==0) {
			cin >> b;
			A.insert(b);
			cout << A.size() << endl;
		}
		else if(a==1){
			cin >> b;
			cout << A.count(b)<< endl;
		}
		else if (a == 2) {
			cin >> b;
			A.erase(b);
		}
		else {
			cin >> b >> c;
			for (set<ll>::iterator j = A.lower_bound(b); j != A.upper_bound(c); ++j) {
				cout << *j << endl;
			}
		}
	}
	return 0;
}

### Prompt

Create a solution in cpp for the following problem:

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

### Response

```cpp
#include <iostream>
#include <iomanip>
#include<vector>
#include <algorithm>
#include <queue>
#include<string>
#include <map>
#include <cmath>
#include <deque>
#include <list>
#include <stack>
#include <queue>
#include <utility>
#include <set>
typedef long long ll;
typedef long double ld;


#define REP(i,s,n)for(ll i=s;i<(n);++i)
#define rep(i,n) REP(i,0,n)
using namespace std;
ll S[1000] = { 0 };
ll N,M,Q;


int main() {
	multiset<ll>A;
	cin >> Q;
	rep(i, Q) {
		ll a, b,c;
		cin >> a ;
		if (a==0) {
			cin >> b;
			A.insert(b);
			cout << A.size() << endl;
		}
		else if(a==1){
			cin >> b;
			cout << A.count(b)<< endl;
		}
		else if (a == 2) {
			cin >> b;
			A.erase(b);
		}
		else {
			cin >> b >> c;
			for (set<ll>::iterator j = A.lower_bound(b); j != A.upper_bound(c); ++j) {
				cout << *j << endl;
			}
		}
	}
	return 0;
}

```