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
#include<set>
#include<iostream>
using namespace std;
int main() {
    int T;
    cin >> T;
    set<int> s;
    while (T--) {
        int a;
        cin >> a;
        if (a==0) {int t; cin >> t;s.insert(t);
            cout << s.size() << endl;
        }
        else if (a==1) {
            int t;
            cin >> t;
            cout << (s.find(t) != s.end()) << endl;
        }
    }
    return 0;
}
