Given a number N, the task is to express N as a summation of 4 positive primes.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains a number N as input.
For each test case, print four positive primes in increasing order. If it is not possible to express as a summation of 4 positive primes then print "-1".
2 2 2 2
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.