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

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class Main {

    public static void main(String[] args) {
        Scanner in=new Scanner (System.in);
        PrintWriter out=new PrintWriter(System.out);
        TreeMap<Integer,Integer> mset=new TreeMap<>();
        int q=Integer.parseInt(in.next()),size=0;
        for(int i=0;i<q;i++) {
            int odr=Integer.parseInt(in.next());

            switch(odr) {
            case 0:
            	int x0=Integer.parseInt(in.next());
            	Integer num0=mset.get(x0);
            	if(num0!=null)mset.put(x0, num0+1);
            	else mset.put(x0, 1);
            	size++;
            	out.println(size);
            	break;

            case 1:
            	int x1=Integer.parseInt(in.next());
            	Integer num1=mset.get(x1);
            	out.println((num1!=null)? num1:0);
            	break;

            case 2:
            	int x2=Integer.parseInt(in.next());
            	Integer num2=mset.get(x2);
            	if(num2!=null)size-=num2;
            	mset.remove(x2);
            	break;

            case 3:
            	int L=Integer.parseInt(in.next()),R=Integer.parseInt(in.next());
            	NavigableMap<Integer,Integer> sub=mset.subMap(L, true, R, true);
            	Iterator<NavigableMap.Entry<Integer,Integer>> itr=sub.entrySet().iterator();
            	
            	while(itr.hasNext()) {
            		NavigableMap.Entry<Integer,Integer> get=itr.next();
            		int k=get.getKey(),num=get.getValue();
            		for(int j=0;j<num;j++)out.println(k);
            	}
            	break;
            }
        }
        out.flush();
    }

}