CodeForces - 1265B Beautiful Numbers （标记元素的位置）

You are given a permutation p=[p1,p2,…,pn] of integers from 1 to n . Let's call the number m (1≤m≤n) beautiful, if there exists two indices l,r (1 ≤ l ≤ r ≤n ), such that the numbers [pl,pl+1,…,pr] is a permutation of numbers 1,2,…,m .

For example, let p=[4,5,1,3,2,6] . In this case, the numbers 1,3,5,6 are beautiful and 2,4 are not. It is because:

• if l=3 and r=3 we will have a permutation [1] for m=1 ;
• if l=3 and r=5 we will have a permutation [1,3,2] for m=3 ;
• if l=1 and r=5 we will have a permutation [4,5,1,3,2] for m=5 ;
• if l=1 and r=6 we will have a permutation [4,5,1,3,2,6] for m=6 ;
• it is impossible to take some l and r , such that [pl,pl+1,…,pr] is a permutation of numbers 1,2,…,m for m=2 and for m=4 .

You are given a permutation p=[p1,p2,…,pn]. For all m (1≤m≤n ) determine if it is a beautiful number or not.

Input

The first line contains the only integer t (1≤t≤1000)  — the number of test cases in the input. The next lines contain the description of test cases.

The first line of a test case contains a number nn (1≤n≤2⋅10^5 ) — the length of the given permutation p . The next line contains nn integers p1,p2,…,pn (1≤pi≤n , all pi are different) — the given permutation p .

It is guaranteed, that the sum of n from all test cases in the input doesn't exceed 2⋅10^5 .

Output

Print tt lines — the answers to test cases in the order they are given in the input.

The answer to a test case is the string of length n , there the i -th character is equal to 1 if i is a beautiful number and is equal to 0 if i is not a beautiful number.

Example

Input

3
6
4 5 1 3 2 6
5
5 3 1 2 4
4
1 4 3 2

Output

101011
11111
1001

Note

The first test case is described in the problem statement.

In the second test case all numbers from 11 to 55 are beautiful:

• if l=3 and r=3 we will have a permutation [1] for m=1 ;
• if l=3 and r=4 we will have a permutation [1,2] for m=2 ;
• if l=2 and r=4 we will have a permutation [3,1,2] for m=3 ;
• if l=2 and r=5 we will have a permutation [3,1,2,4] for m=4 ;
• if l=1 and r=5 we will have a permutation [5,3,1,2,4] for m=5 .

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=200005;

int a[maxn],ans[maxn];

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,x,l,r;
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&x);
            a[x]=i; //标记元素的位置
            if(x==1)
                l=r=i;
        }
        memset(ans,0,sizeof(ans));
        ans[1]=1;
        for(int i=2; i<=n; i++)
        {
            l=min(a[i],l);
            r=max(a[i],r);
            if(r-l+1<=i)
                ans[i]=1;
        }
        for(int i=1; i<=n; i++)
            printf("%d",ans[i]);
        printf("\n");
    }
    return 0;
}