A state with $n$ flags of ON or OFF can be represented by a sequence of bits where $0, 1, ..., n-1$ -th flag corresponds to 1 (ON) or 0 (OFF). The state can be managed by the corresponding decimal integer, because the sequence of bits is a binary representation where each bit is 0 or 1.

Given a sequence of bits with 64 flags which represent a state, perform the following operations. Note that each flag of the bits is initialized by OFF.

* test(i): Print 1 if $i$-th flag is ON, otherwise 0
* set(i): Set $i$-th flag to ON
* clear(i): Set $i$-th flag to OFF
* flip(i): Inverse $i$-th flag
* all: Print 1 if all flags are ON, otherwise 0
* any: Print 1 if at least one flag is ON, otherwise 0
* none: Print 1 if all flags are OFF, otherwise 0
* count: Print the number of ON flags
* val: Print the decimal value of the state

Constraints

* $1 \leq q \leq 200,000$
* $0 \leq i < 64$

Input

The input is given in the following format.


$q$
$query_1$
$query_2$
:
$query_q$


Each query $query_i$ is given in the following format:


0 $i$


or


1 $i$


or


2 $i$


or


3 $i$


or


4


or


5


or


6


or


7


or


8


The first digit 0, 1,...,8 represents the operation test(i), set(i), clear(i), flip(i), all, any, none, count or val respectively.

Output

Print the result in a line for each test, all, any, none, count and val operation.

Example

Input

14
1 0
1 1
1 2
2 1
0 0
0 1
0 2
0 3
3 3
4
5
6
7
8


Output

1
0
1
0
0
1
0
3
13
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
// #define DEBUG


unsigned long long getint(int x[], int n){
    unsigned long long ret = 0;
    unsigned long long p[n];
    rep(i, n)
        p[i] = 1ll << i;
    rep(i, n)
        ret += x[i] * p[i];
    return ret;
}

int bitcount(int x[], int n){
    int ret = 0;
    rep(i, n)
        ret += x[i];
    return ret;
}

int main()
{

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif
    const int b = 64;
    int q, x, y, bits[b];
    fill(bits, bits + b, 0);
    cin >> q;
    rep(i, q)
    {
        cin >> x;
        if (x == 0)
        {
            cin >> y;
            cout << bits[y] << endl;
        }
        else if (x == 1)
        {
            cin >> y;
            bits[y] = 1;
        }
        else if (x == 2)
        {
            cin >> y;
            bits[y] = 0;
        }
        else if (x == 3)
        {
            cin >> y;
            bits[y] = 1 - bits[y];
        }
        else if (x == 4)
        {
            cout << ( (bitcount(bits, b) == b) ? 1 : 0 ) << endl;
        }
        else if (x == 5)
        {
            cout << ( (bitcount(bits, b) > 0) ? 1 : 0 ) << endl;
        }
        else if (x == 6)
        {
            cout << ( (bitcount(bits, b) == 0) ? 1 : 0 ) << endl;
        }
        else if (x == 7)
        {
            cout << bitcount(bits, b) << endl;
        }
        else if (x == 8)
        {
            printf( "%llu\n", getint(bits, b) );
        }
    }

    return 0;
}

