human
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.

Input

The first line contains a single integer t (1 ≤ t ≤ 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 ≤ n ≤ 100.
0 ≤ U, R, D, L ≤ n).

Output

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).

Example

Input

4
5 2 5 3 1
3 0 0 0 0
4 4 1 4 0
2 1 1 1 1

Output

YES
YES
NO
YES

Note

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


=====
Write me a Python program to print "YES" if the solution exists and "NO" otherwise?
assistant
#Here is Python program to print "YES" if the solution exists and "NO" otherwise.


from __future__ import division, print_function

import os,sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

# sys.setrecursionlimit(10000000)

def dmain():
    sys.setrecursionlimit(1000000)
    threading.stack_size(1024000)
    thread = threading.Thread(target=main)
    thread.start()
    
#from collections import deque, Counter, OrderedDict,defaultdict
#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace
#from math import log,sqrt,factorial,cos,tan,sin,radians
#from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
#from decimal import *
#import threading
#from itertools import permutations
#Copy 2D list  m = [x[:] for x in mark] .. Avoid Using Deepcopy

# abc='abcdefghijklmnopqrstuvwxyz'
# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}
# mod=1000000007
# #mod=998244353
# inf = float("inf")
# vow=['a','e','i','o','u']
# dx,dy=[-1,1,0,0],[0,0,1,-1]
# def getKey(item): return item[1] 
# def sort2(l):return sorted(l, key=getKey,reverse=True)
# def d2(n,m,num):return [[num for x in range(m)] for y in range(n)]
# def isPowerOfTwo (x): return (x and (not(x & (x - 1))) )
# def decimalToBinary(n): return bin(n).replace("0b","")
# def ntl(n):return [int(i) for i in str(n)]
# def ncr(n,r): return factorial(n)//(factorial(r)*factorial(max(n-r,1)))

# def ceil(x,y):
#     if x%y==0:
#         return x//y
#     else:
#         return x//y+1

# def powerMod(x,y,p):
#     res = 1
#     x %= p
#     while y > 0:
#         if y&1:
#             res = (res*x)%p
#         y = y>>1
#         x = (x*x)%p
#     return res

# def gcd(x, y):
#     while y:
#         x, y = y, x % y
#     return x
    
def isPrime(n) : # Check Prime Number or not 
    if (n <= 1) : return...