For a set $S$ of integers, perform a sequence of the following operations. Note that each value in $S$ must be unique.

* 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$ (0 or 1).

Constraints

* $1 \leq q \leq 200,000$
* $0 \leq x \leq 1,000,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$


where the first digits 0 and 1 represent insert and find 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$.

Example

Input

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


Output

1
2
3
3
4
1
0
import bisect

S=[]

def insert(S,count,x):
    y=bisect.bisect(S,x)
    if y-1<0 or S[y-1]!=x:
        S.insert(y,x)
        count+=1
    print(count)
    return S,count

def find(S,x):
    y=bisect.bisect(S,x)
    if y-1>=0 and S[y-1]==x:
        print(1)
    else:
        print(0)

q=int(input())
count=0
for i in range(q):
    query=list(map(int,input().split()))
    if query[0]==0:
        S,count=insert(S,count,query[1])
    else:
        find(S,query[1])

