Despite his bad reputation, Captain Flint is a friendly person (at least, friendly to animals). Now Captain Flint is searching worthy sailors to join his new crew (solely for peaceful purposes). A sailor is considered as worthy if he can solve Flint's task.

Recently, out of blue Captain Flint has been interested in math and even defined a new class of integers. Let's define a positive integer $x$ as nearly prime if it can be represented as $p \cdot q$, where $1 < p < q$ and $p$ and $q$ are prime numbers. For example, integers $6$ and $10$ are nearly primes (since $2 \cdot 3 = 6$ and $2 \cdot 5 = 10$), but integers $1$, $3$, $4$, $16$, $17$ or $44$ are not.

Captain Flint guessed an integer $n$ and asked you: can you represent it as the sum of $4$ different positive integers where at least $3$ of them should be nearly prime.

Uncle Bogdan easily solved the task and joined the crew. Can you do the same?


-----Input-----

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

Next $t$ lines contain test cases — one per line. The first and only line of each test case contains the single integer $n$ $(1 \le n \le 2 \cdot 10^5)$ — the number Flint guessed.


-----Output-----

For each test case print:   YES and $4$ different positive integers such that at least $3$ of them are nearly prime and their sum is equal to $n$ (if there are multiple answers print any of them);  NO if there is no way to represent $n$ as the sum of $4$ different positive integers where at least $3$ of them are nearly prime.  You can print each character of YES or NO in any case.


-----Example-----
Input
7
7
23
31
36
44
100
258

Output
NO
NO
YES
14 10 6 1
YES
5 6 10 15
YES
6 7 10 21
YES
2 10 33 55
YES
10 21 221 6


-----Note-----

In the first and second test cases, it can be proven that there are no four different positive integers such that at least three of them are nearly prime.

In the third test case, $n=31=2 \cdot 7 + 2 \cdot 5 + 2 \cdot 3 + 1$: integers $14$, $10$, $6$ are nearly prime.

In the fourth test case, $n=36=5 + 2 \cdot 3 + 2 \cdot 5 + 3 \cdot 5$: integers $6$, $10$, $15$ are nearly prime.

In the fifth test case, $n=44=2 \cdot 3 + 7 + 2 \cdot 5 + 3 \cdot 7$: integers $6$, $10$, $21$ are nearly prime.

In the sixth test case, $n=100=2 + 2 \cdot 5 + 3 \cdot 11 + 5 \cdot 11$: integers $10$, $33$, $55$ are nearly prime.

In the seventh test case, $n=258=2 \cdot 5 + 3 \cdot 7 + 13 \cdot 17 + 2 \cdot 3$: integers $10$, $21$, $221$, $6$ are nearly prime.

Difficulty: interview

Starter code:

Solutions:
# for _ in range(1):
for _ in range(int(input())):
    # a, b = map(int, input().split())
    n = int(input())
    # arr = list(map(int, input().split()))
    # s = input()
    x = 6 + 10 + 14
    if x + 1 > n:
        print('NO')
        continue
    y = n - x
    if y not in (6, 10, 14):
        print('YES')
        print(6, 10, 14, y)
        continue
    x += 1
    y -= 1
    if y == 0:
        print('NO')
    else:
        print('YES')
        print(6, 10, 15, y)


tests = int(input())
for tests in range(tests):
    n = int(input())
    if n <= 30:
        print("NO")
    else:
        print("YES")
        if n - 30 in [14, 6, 10]:
            print(15, 6, 10, n - 31)
        else:
            print(14, 6, 10, n - 30)

for test in range(int(input())):
    n = int(input())
    c = 6 + 10 + 14
    if n - c >= 1:
        print('YES')
        if n - c == 6 or n - c == 10 or n - c == 14:
            print(6, 10, 15, n - c - 1)
        else:
            print(6, 10, 14, n - c)
    else:
        print('NO')


for _ in range(int(input())):
    N=int(input())
    if(N>30):
        print("YES")
        if(N-30 == 6):
            print(6,10,15,5)
        elif(N-30 == 10):
            print(6,10,15,9)
        elif(N-30 == 14):
            print(6,10,15,13)
        else:
            print(6,10,14,N-30)
    else:
        print("NO")

t=int(input())
for i in range(0,t):
	n=int(input())
	if(n>30):
		if(n!=36 and n!=40 and n!=44):
			print("YES")
			L=[6,10,14,n-30]
			print(*L)
		else:
			if(n==36):
				L=[6,10,15,5]
				print("YES")
				print(*L)
			elif(n==40):
				L=[6,10,15,9]
				print("YES")
				print(*L)
			if(n==44):
				L=[6,10,15,13]
				print("YES")
				print(*L)
	else:
		print("NO")

for _ in range(int(input())):
    n = int(input())
    if n <= 30:
        print("NO")
    else:
        print("YES")
        if n - 30 == 6:
            print(6, 10, 15, 5)
        elif n - 30 == 10:
            print(6, 10, 15, 9)
        elif n - 30 == 14:
            print(6, 10, 15, 13)
        else:
            print(6, 10, 14, n - 30)

import sys
input = sys.stdin.readline

t=int(input())
for tests in range(t):
    n=int(input())

    if n<=30:
        print("NO")
    else:
        print("YES")
        if n-30 in [6,10,14]:
            print(6,10,15,n-31)
        else:
            print(6,10,14,n-30)
    


t= int(input())
for i in range(t):
  n=int(input())
  if n<=30:
    print('NO')
  else:
    print('YES')
    if (n-30)!=6 and (n-30)!=10 and (n-30)!=14:
      print(str(6)+' '+str(10)+' '+str(14)+' '+str(n-30))
    else:
      print(str(6)+' '+str(10)+' '+str(15)+' '+str(n-31))

x = [6, 10, 14]
T = int(input())
for _ in range(T):
    y = int(input())
    if y >= sum(x) + 1:
        if y - sum(x) in x:
            print("YES")
            print(6,10,15,y-sum(x)-1)
            continue
        else:
            print("YES")
            print(" ".join(map(str, x)), y - sum(x))
            continue
    print("NO")



for _ in range(int(input())):
    n=int(input())
    if n<31:
        print("NO")
    else:
        print("YES")
        if n!=36 and n!=40 and n!=44:
            print(6,10,14,n-30)
        else:
            print(6,10,15,n-31)

# import sys
# input=sys.stdin.readine

t=int(input())
for _ in range(t):
    n=int(input())
    if n<=30:
        print("NO")
    else:
        if n-30 not in set([6,10,14]):
            print("YES")
            print(*sorted([6,10,14,n-30]))
        else:
            print("YES")
            print(*sorted([6,10,15,n-31]))

for _ in range(int(input())):
    n = int(input())

    if n <= 30:
        print('NO')
    else:
        print('YES')
        if n in {36, 40, 44}:
            print(f'6 10 15 {n - 31}')
        else:
            print(f'6 10 14 {n - 30}')


# 6, 10, 15, 14

t = int(input())

for _ in range(t):
    n = int(input())
    
    if n <= 30:
        print("NO")
    else:
        print("YES")
        if n-30 in [6, 10, 14]:
            print(6, 10, 15, n-31)
        else:
            print(6, 10, 14, n-30)


for _ in range(int(input())):
    n = int(input())
    if n <= 30:
        print('NO')
    else:
        print('YES')
        if n - 30 == 6:
            print(6, 10, 15, 5)
        elif n - 30 == 10:
            print(6, 10, 15, 9)
        elif n - 30 == 14:
            print(6, 10, 13, 15)
        else:
            print(6, 10, 14, n - 30)


MIN = 2*3 + 2*5 + 2*7

t = int(input())
for i in range(t):
    n = int(input())
    if n <= MIN:
        print("NO")
    else:
        print("YES")
        if n-MIN in (6, 10, 14):
            print("6 10 15", n - MIN - 1)
        else:
            print("6 10 14", n - MIN)

from sys import stdin, stdout
import math
from collections import defaultdict
# from collections import OrderedDict
from collections import Counter
# from queue import deque
# from math import log2


def arrinp():
    return [*list(map(int, stdin.readline().split(' ')))]


def mulinp():
    return list(map(int, stdin.readline().split(' ')))


def intinp():
    return int(stdin.readline())


def inp():
    return stdin.readline()


def solution():
    n = intinp()
    if n > 30:
        if n-30 == 6:
            print('YES')
            print(5, 6, 10, 15)
        elif n-30 == 10:
            print('YES')
            print(6, 10, 15, 9)
        elif n-30 == 14:
            print('YES')
            print(6, 10, 15, 13)
        else:
            print('YES')
            print(6, 10, 14, n-30)
    else:
        print('NO')


testcases = 1
testcases = intinp()
for _ in range(testcases):
    solution()


from sys import stdin
"""
n=int(stdin.readline().strip())
n,m=map(int,stdin.readline().strip().split())
s=list(map(int,stdin.readline().strip().split()))
"""
n=int(stdin.readline().strip())
for i in range(n):
    x=int(stdin.readline().strip())
    ans=[6,10,14]
    ans1=[6,10,15]
    sm=sum(ans)
    sm1=sm+1
    
    if x>sm and x-sm not in ans:
        print("YES")
        ans.append(x-sm)
        print(*ans)
    elif x>sm1 and x-sm1 not in ans1:
        print("YES")
        ans1.append(x-sm1)
        print(*ans1)
    else:
        print("NO")
        


import sys
input = sys.stdin.readline
from math import gcd
 
t = int(input())

for ccc in range(t):
    x = int(input())
    
    if x>6+10+14:
        print('YES')
        if x-30 not in [6,10,14]:
            print(6,10,14,x-30)
        else:
            print(6,10,15,x-31)
    else:
        print('NO')

import sys
input = sys.stdin.readline
for f in range(int(input())):
    n=int(input())
    if n>30:
        print("YES")
        if n-30 not in [6,10,14]:
            print(6,10,14,n-30)
        else:
            if n-30==6:
                print(5,6,10,15)
            if n-30==10:
                print(6,9,10,15)
            if n-30==14:
                print(6,10,13,15)
    else:
        print("NO")