#pragma GCC optimize("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
const long double Pi = 3.141592653;
const ll mod=1e9+7;
long long INF = 1000000000000000000;
bool cmp(pair<int,int>a,pair<int,int>b)
{
    return (a.first<b.first) || (a.first==b.first && a.second>b.second);
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t=1;cin>>t;
    while(t--)
    {
       int n,u,r,d,l;cin>>n>>u>>r>>d>>l;
       bool ok=false;
       for(int i=0;i<16;i++)
       {
               int h[4]={0};
               for(int j=0;j<4;j++)
               {
                       if(i & (1<<j))
                       h[j]=1;
               }
           ll x1=u-h[0]-h[1];
           ll x2=l-h[0]-h[2];
           ll x3=r-h[1]-h[3];
           ll x4=d-h[2]-h[3];
           if(x1<0 || x2<0 || x3<0 || x4<0)
           continue;
           if(x1>n-2 || x2>n-2 ||x3>n-2 || x4>n-2)
           continue;
           ok=true;
       }
       if(ok)
       cout<<"YES"<<endl;
       else
       cout<<"NO"<<endl;
    }
}