#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod=998244353;
const int N=1e5+100;
const int maxn=1e6;
const int MAXL=sqrt(1e14)+1;
inline int read() {
    char c = getchar(); int x = 0, f = 1;
    while(c < '0' || c > '9') {if(c == '-') f = -1; c = getchar();}
    while(c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}
int n;
int a,b,c,d;
void solve()
{
    n=read();
    a=read();   b=read();
    c=read();   d=read();
    int flag=0;
    int aa,bb,cc,dd;
    for(int i=0;i<=1;i++)
    {
        for(int j=0;j<=1;j++)
        {
            for(int k=0;k<=1;k++)
            {
                for(int z=0;z<=1;z++)
                {
                    aa=a;
                    bb=b;
                    cc=c;
                    dd=d;
                    if(i==1)
                    {
                        aa--;   dd--;
                    }
                    if(j==1)
                    {
                        aa--;   bb--;
                    }
                    if(k==1)
                    {
                        bb--;   cc--;
                    }
                    if(z==1)
                    {
                        cc--;   dd--;
                    }
                    if(aa>=0&&aa<n-1&&bb>=0&&bb<n-1&&cc>=0&&cc<n-1&&dd>=0&&dd<n-1)
                    {
                        puts("YES");    return;}

                }
            }
        }
    }
    puts("NO");

}


int main()
{
    int T=1;
    scanf("%d",&T);
    //T=1;
    //cout<<tot<<endl;
    int tt=0;
    while(T--)

    {
        //if(n==0)    break;
        //printf("Case %d: ",++tt);
        solve();
    }

    return 0;

}
