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
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	set:search
# CreatedDate:  2020-06-10 21:03:41 +0900
# LastModified: 2020-06-10 21:13:52 +0900
#


import os
import sys
#import numpy as np
#import pandas as pd


def main():
    q=int(input())
    a=set()
    for _ in range(q):
        command,x=map(int,input().split())
#        print(command,x)
        if command==0:
            a.add(int(x))
            print(len(a))

        else:
            if int(x) in a:
                print(1)
            else:
                print(0)

        


if __name__ == "__main__":
    main()

