CF1494B.Berland Crossword

Berland crossword is a puzzle that is solved on a square grid with $n$ rows and $n$ columns. Initially all the cells are white.

To solve the puzzle one has to color some cells on the border of the grid black in such a way that:

• exactly $U$ cells in the top row are black;
• exactly $R$ cells in the rightmost column are black;
• exactly $D$ cells in the bottom row are black;
• exactly $L$ cells in the leftmost column are black.

Note that you can color zero cells black and leave every cell white.

Your task is to check if there exists a solution to the given puzzle.

伯兰德填字游戏是一种在 $n$ 行 $n$ 列的正方形网格上求解的谜题。初始时，所有格子均为白色。

要解开该谜题，需将网格边界上的某些格子涂成黑色，使得满足以下条件：

• 顶行中恰好有 $U$ 个格子为黑色；
• 最右列中恰好有 $R$ 个格子为黑色；
• 底行中恰好有 $D$ 个格子为黑色；
• 最左列中恰好有 $L$ 个格子为黑色。

注意：你可以将零个格子涂黑，即保持所有格子均为白色。

你的任务是判断给定的谜题是否存在解。

The first line contains a single integer $t$ ($1 \le t \le 1000$) — the number of testcases.

Then the descriptions of $t$ testcases follow.

The only line of each testcase contains $5$ integers $n, U, R, D, L$ ($2 \le n \le 100$; $0 \le U, R, D, L \le n$).

第一行包含一个整数 $t$（$1 \le t \le 1000$）—— 表示测试用例的数量。

接下来是 $t$ 个测试用例的描述。

每个测试用例仅有一行，包含 $5$ 个整数 $n, U, R, D, L$（$2 \le n \le 100$；$0 \le U, R, D, L \le n$）。

For each testcase print "YES" if the solution exists and "NO" otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).

对于每个测试用例，如果解存在则输出 “YES”，否则输出 “NO”。

你可以以任意大小写形式输出每个字母（例如，字符串 yEs、yes、Yes 和 YES 均被视为肯定回答）。

Here are possible solutions to testcases $1$, $2$ and $4$:

以下是测试用例 $1$、$2$ 和 $4$ 的可能解法：