#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>

#define INF 0x3f3f3f3f

using namespace std;


void solve(){
    int a[5];
    int b[5];
    int n;
    cin >> n;
    for(int i = 0;i < 4;i++)
        cin >> a[i];
    int u = 0,r = 0,d = 0,l = 0;
    bool flg = false;
    for(int i = 0;i < (1 << 4);i++){
        for(int j = 0;j < 4;j++)
            b[j] = 0;
        int x = i,idx = 0;
        while (x){
            if(x & 1){
                b[idx]++;
                b[(idx+1) % 4]++;
            }
            x >>= 1;
            idx++;
        }
        bool flag = true;
        for(int j = 0;j < 4;j++){
            if(b[j] > a[j] || b[j] + n - 2 < a[j]){
                flag = false;
            }
        }
        if(flag){
            puts("YES");
            return;
        }
    }
    puts("NO");
}

int main(){
    int t = 1;
    cin >> t;
    while (t--)
        solve();
    return 0;
}