#include "bits/stdc++.h"
using namespace std;
 
typedef long long int ll;
typedef pair<int , int> pii; typedef pair<ll , ll> pll;
#define pb push_back
#define fs first
#define sc second
#define all(x) x.begin(), x.end()

const ll N = 2e5 + 5, LOG = 20, INF = 1e9+1, SQ = 375, base = 100, MOD = 610612741;
bool ch1(string s){
	int t1= 0, t2 = 0;
	for(int i = 0; i  < s.size(); i++){
		if(s[i] == '(')t1++;
		else t2++;
		if(t1 < t2)return false;
	}
	if(t1 != t2)return false;
	return true;
}

int main() {
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int t;
	cin >> t;

	while(t--){
		int u, l, r, d, n;
		cin >> n >> u >> r >> d >> l;
		if(u == 0 && (l>=n || r>=n)){cout << "NO\n"; continue;}
		if(r == 0 && (u>=n || d>=n)){cout << "NO\n"; continue;}
		if(d == 0 && (l>=n || r>=n)){cout << "NO\n"; continue;}
		if(l == 0 && (u>=n || d>=n)){cout << "NO\n"; continue;}
		if(u == n-1 && l == 0 && r == 0){cout << "NO\n"; continue;}
		if(d == n-1 && l == 0 && r == 0){cout << "NO\n"; continue;}
		if(l == n-1 && u == 0 && d == 0){cout << "NO\n"; continue;}
		if(r == n-1 && u == 0 && d == 0){cout << "NO\n"; continue;}
		if(u+d-(2*n-4) > l+r){cout << "NO\n"; continue;}
		if(l+r-(2*n-4) > u+d){cout << "NO\n"; continue;}
		if(u <= 1 && (l>=n && r>=n)){cout << "NO\n"; continue;}
		if(d <= 1 && (l>=n && r>=n)){cout << "NO\n"; continue;}
		if(r <= 1 && (u>=n && d>=n)){cout << "NO\n"; continue;}
		if(l <= 1 && (u>=n && d>=n)){cout << "NO\n"; continue;}
		cout << "YES\n";

	}

	return 0;
}


/*

*/
