#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n";
using namespace std;

const int INFINT = 2e9;
const ll INFLL = 2e18;

void solve() {
    vector<int> A(4);
    int N; cin >> N >> A[0] >> A[1] >> A[2] >> A[3];
    bool ans = true;
    if (N == 2) {
        ans = false;
        for (int bit=0; bit<(1<<4); bit++) {
            vector<int> B(4, 0);
            for (int j=0; j<4; j++) {
                if ((bit>>j)&1) {
                    B[j]++;
                    B[(j+1)%4]++;
                }
            }
            bool ok = true;
            for (int j=0; j<4; j++) {
                if (B[j] != A[j]) {
                    ok = false;
                }
            }
            if (ok) {
                ans = true;
                break;
            }
        }
    } else {
        vector<int> M(4, 0), R(2,0);
        for (int i=0; i<4; i++) {
            if (A[i] == N) {
                M[(i+1)%4]++;
                M[(i+3)%4]++;
            } else if (A[i] == N-1) {
                R[(i+1)%2]++;
            }
        }
        bool ok = true;
        for (int i=0; i<4; i++) {
            // cout << M[i] << endl;
            if (A[i] - M[i] < 0) ok = false;
        }
        for (int i=0; i<2; i++) {
            if (A[i]+A[i+2] < M[i]+M[i]+R[i]) ok = false;
        }
        ans = ok;
    }

    cout << (ans ? "YES" : "NO") << endl; 
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int Q; cin >> Q;
    for (int q=0; q<Q; q++) {
        solve();
    }
}