Problem:
Set: Search

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).

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$.

Constraints

$1 \leq q \leq 200,000$

$0 \leq x \leq 1,000,000,000$

Sample Input 1

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

Sample Output 1

1
2
3
3
4
1
0

Solution in C++ (judge verdict: Accepted)

#include<bits/stdc++.h>

using namespace std;



int main()
{
    int a,b,c;
    set<int> s;
    set<int>:: iterator it;
    scanf("%d ",&a);


    for(int k=0;k<a;k++){
    scanf("%d",&b);
    if (b==0){
            scanf("%d",&c);
            s.insert(c);
            cout<<s.size()<<endl;

            }
    else if (b==1){

             scanf("%d",&c);
             it=s.find(c);
             if(it!=s.end()){

                printf("1\n");

            }
             else{
               printf("0\n");
            }

    }

     else if (b==2){

           scanf("%d",&c);
         
           s.erase(c);


    }

    }
    return 0;



}