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
import bisect
import sys
def input():
    return sys.stdin.readline().strip()
S = []
count = {}
total = 0

for _ in range(int(input())):
    order = tuple(map(int,input().split()))
    value = order[1]
    if order[0] == 0:
        if value in count:
            count[value] += 1
        else:
            count[value] = 1
            bisect.insort(S,value)
        total += 1
        print(total)
    elif order[0] == 1:
        if value in count:
            print(count[value])
        else:
            print(0)
    elif order[0] == 2:
        if value in count:
            total -= count[value]
            count[value] = 0

    else:
        left = bisect.bisect_left(S,order[1])
        right = bisect.bisect(S,order[2])

        out = []

        for i in range(left,right):
            out += [S[i]]*count[S[i]]
        
        for i in out:
            print(i)
"""  
    print(S)
    print(count)
"""
