test-3

#include <iostream>
#include <vector>
#include <algorithm>
#include <deque>
using namespace std;

int main()
{
	int m;
	cin >> m;
	while (m-- > 0) {
		int n;
		cin >> n;
		bool hasResult = true;
		int left = 0, right = 0;
		vector<int> array;
		while (n-- > 0) {
			int t;
			cin >> t;
			array.push_back(t);
		}
		sort(array.begin(), array.end());
		deque<int> q;
		if (array.size() == 1) {
			
			cout << "YES" << endl;
			break;
		}
		if (array.size() == 2) {
			if(array[0]*2>array[1]&&array[1]*2>array[0])
			cout << "YES" << endl;
			else cout << "NO" << endl;
			break;
		}
		for (int i = 0; i < array.size(); i++) {
			if (left == 0) {
				left = right = array[i];
				q.push_front(array[i]);
			}
			else
				if (left < right) {
					q.push_front(array[i]);
					left = array[i];
				}
				else {
					q.push_back(array[i]);
					right = array[i];
				}
		}
		for (int i = 1; i < q.size() - 1; i++) {
			if (q[i] < q[i - 1] + q[i + 1]) {

			}
			else {
				cout << "NO" << endl;
				hasResult = false;
			}
		}

		if (q[0] < q[1] + q[q.size() - 1] && q[q.size() - 1] < q[q.size() - 2] + q[0] && hasResult == true) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}




}