/*
 _____ _             _              _           _
|_   _| |__   ___   / \   _ __  ___| |__  _   _| |
  | | | '_ \ / _ \ / _ \ | '_ \/ __| '_ \| | | | |
  | | | | | |  __// ___ \| | | \__ \ | | | |_| | |
  |_| |_| |_|\___/_/   \_\_| |_|___/_| |_|\__,_|_|

*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll          long long
#define pb          push_back
#define ppb         pop_back
#define    endl        '\n'
#define mii         map<ll,ll>
#define msi         map<string,ll>
#define mis         map<ll, string>
#define rep(i,a,b)    for(ll i=a;i<b;i++)
#define repr(i,a,b) for(ll i=b-1;i>=a;i--)
#define trav(a, x)     for(auto& a : x)
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pair<ll, ll>>
#define vs          vector<string>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define max(a,b)    (a>b?a:b)
#define min(a,b)    (a<b?a:b)

/*    For Debugging    */
#define DEBUG         cerr<<"\n>>>I'm Here<<<\n"<<endl;
#define display(x) trav(a,x) cout<<a<<" ";cout<<endl;
#define what_is(x)  cerr << #x << " is " << x << endl;

std::mt19937_64 rng(std::chrono::steady_clock::now().time_since_epoch().count());
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define TIME        cerr << "\nTime elapsed: " << setprecision(5) <<1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
#define DECIMAL(n)  cout << fixed ; cout << setprecision(n);
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace __gnu_pbds;
using namespace std;
#define PI 3.141592653589793
#define N  100005

vi v;
ll n;
ll dp[105][105][105];
bool fun(ll i,ll num1,ll num2) {
    if(i>=n) {
        return 1;
    }
    if(dp[i][num1][num2]!=-1) {
        return dp[i][num1][num2];
    }
    ll& ans = dp[i][num1][num2];
    ans = 0;
    if(v[i]>num1) {
        ans |= fun(i+1,v[i],num2);
        if(ans) {
            return ans;
        }
    }
    if(v[i]<num2) {
        ans |= fun(i+1,num1,v[i]);
        if(ans) {
            return ans;
        }
    }
    return ans;
}

void ansOut(ll num) {
	cerr<<"NO\n";
    rep(i,0,n+1) {
        rep(j,0,101) {
            rep(k,0,101) {
                dp[i][j][k] = -1;
            }
        }
    }
    if(fun(1,v[0],101) || fun(1,0,v[0])) {
        cout<<0<<endl;
        return;
    }
    cout<<1<<endl;
    return;

}
void ansOut(ll num,vi a,vi b) {
  	cerr<<"YES\n";
    rep(i,1,sz(a)) {
        if(a[i]<=a[i-1]) {
            cout<<0<<endl;
            return;
        }
    }
    rep(i,1,sz(b)) {
        if(b[i]>=b[i-1]) {
            cout<<0<<endl;
            return;
        }
    }
    cout<<1<<endl;
    return;
}


void solve()
{
    cin>>n;
    v.resize(n);
    rep(i,0,n) {
        cin>>v[i];
    }
    vi a,b;

    auto checkA = [&] (ll num) {
        if(a.empty() || a.back()<num) {
            return 1;
        }
        return 0;
    };

    auto checkB = [&] (ll num) {
        if(b.empty() || b.back()>num) {
            return 1;
        }
        return 0;
    };

    rep(i,0,n-1) {
        if(v[i]<v[i+1]) {
            if(checkA(v[i])) {
                a.pb(v[i]);
            } else if(checkB(v[i])) {
                b.pb(v[i]);
            } else {
                ansOut(0);
                return;
            }
        } else if(v[i]>v[i+1]) {
            if(checkB(v[i])) {
                b.pb(v[i]);
            } else if(checkA(v[i])) {
                a.pb(v[i]);
            } else {
                ansOut(0);
                return;
            }
        } else {
            if(checkA(v[i]) && checkB(v[i])) {
                a.pb(v[i]);
                b.pb(v[i]);
                i++;
            } else {
                ansOut(0);
                return;
            }
        }
    }
    if(checkA(v[n-1])) {
        a.pb(v[n-1]);
    } else if(checkB(v[n-1])) {
        b.pb(v[n-1]);
    } else {
        ansOut(0);
        return;
    }
    ansOut(1,a,b);
    return;
}
int main()
{
	#ifndef ONLINE_JUDGE
	freopen ("input.txt","r",stdin);
	// freopen("output.txt","w",stdout);
	#endif
    FAST
    int TESTS=1;
   cin>>TESTS;
    rep(i,0,TESTS)
    {
        // cout<<"Case #"<<i+1<<": ";
        solve();
    }
    TIME
    return 0;
}