#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long int
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define inf (int) 2e9
#define infll (long long) 2e18
#define N 200005
using namespace std;
 
struct Data{
    int x, y, w;
    Data(int _x, int _y, int _w) : x(_x), y(_y), w(_w) {}
};
 
void printline(vector<int> v){
    for(int i = 0; i < (int)v.size(); i++){
        if(i) cout << " ";
        cout << v[i];
    }
    cout << endl;
}
 
void printcol(vector<int> v){
    for(auto x : v)
        cout << x << endl;
}
int n;
 
int LEFT = 0;
int RIGHT = 1;
int BOTH = 2;
int NONE = 3;
 
/*
    code:
        0 -> Left
        1 -> Right
        2 -> Both
        3 -> None
 
*/
 
bool ok(int U, int R, int D, int L, int u, int r, int d, int l){
    if(U == LEFT){
        u--;
        l--;
    }
    else if(U == RIGHT) {
        u--;
        r--;
    }
    else if(U == BOTH) {
        u -= 2;
        l --;
        r --;
    }
    
 
    if(R == RIGHT){
        r--;
        d--;
    } else if(R == BOTH){
        r--;
        d--;
    }
    if(D == RIGHT){
        d--;
        l--;
    } else if(D == BOTH){
        d--;
        l--;
    }
 
    if(u < 0 or r < 0 or d < 0 or l < 0) return false;
    if(n - 2 < u or n - 2 < r or n - 2 < d or n - 2 < l) return false;
 
    return true;
}
 
void solve(){
    cin >> n;
    int u, r, d, l;
    cin >> u >> r >> d >> l;
    
    for(int i = 0; i < 4; i++)
        for(int j = 0; j < 4; j++)
            for(int k = 0; k < 4; k++)
                for(int x = 0; x < 4; x++){
                    if(ok(i, j, k, x, u, r, d, l)) {
                        cout << "YES" << endl;
                        return;
                    }
                }
 
    cout << "NO" << endl;
}
 
 
 
 
 
int main(){
    
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int t;
    cin >> t;
    while(t--){
        solve();
    }
 
    return 0;
}
 