#include <bits/stdc++.h>
#define F(i, l, r) for(int i = (l), _end_ = (int)(r); i <= _end_; ++i)
#define f(i, r, l) for(int i = (r), _end_ = (int)(l); i >= _end_; --i)
#define Set(a, v) memset(a, v, sizeof(a))
#define File(a) freopen(a".in","r",stdin);freopen(a".out","w",stdout)
using namespace std;
bool chkmin(int &a, int b) {return b < a ? a = b, 1 : 0;}
bool chkmax(int &a, int b) {return b > a ? a = b, 1 : 0;}
 
inline int read() {
 int x = 0, fh = 1; char ch = getchar();
    for (; !isdigit(ch); ch = getchar() ) if (ch == '-') fh = -1;
    for (; isdigit(ch); ch = getchar() ) x = (x<<1) + (x<<3) + (ch ^ '0');
    return x * fh;
}
int n;
int len,ll,rr,dd,uu;
bool check(int n, int U, int R, int D, int L, int mask){
	if(mask&1){
		U--;
		R--;
	}
	if(mask&2){
		U--;
		L--;
	}
	if(mask&4){
		D--;
		R--;
	}
	if(mask&8){
		D--;
		L--;
	}
	return 0<=min(min(U,R),min(D,L))&&max(max(U,R),max(D,L))<=n-2;
}
 
void solve(){
	F(i,0,15){
		if(check(len,uu,rr,dd,ll,i)){
           puts("YES");
		   return ;
		}
	}
	puts("NO");
}
int main () {
#ifndef ONLINE_JUDGE
	File("a");
#endif
    scanf("%d\n",&n);
	while(n--){
	   len=read();
	   uu=read();
	   rr=read();
	   dd=read();
	   ll=read();
	   solve();
	}
	return 0;
}