#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <stack>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <bitset>
#include <complex>
#include <fstream>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T> T RoundOff(T a){ return int(a+.5-(a<0)); }
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

int main()
{
	int n;
	cin >> n;
	
	rep(i, n)
	{
		queue<int> a;

		rep(i, 10)
		{
			int in;
			cin >> in;
			a.push(in);
		}


		stack<int> b, c;
		b.push(0);
		c.push(0);

		while(!a.empty())
		{
			// ツ湘ュツづ可つつづ個陛サツつェツ妥・ツつォツつ「
			if(b.top() < c.top()) swap(c, b);

			if(b.top() < a.front())
			{
				b.push(a.front());
				a.pop();
			}
			else if(c.top() < a.front())
			{
				c.push(a.front());
				a.pop();
			}
			else break;
		}

		cout << (a.empty() ? "YES" : "NO") << endl;
	}
}