For this Question: Given a number (greater than 2), print two prime numbers whose sum will be equal to given number, else print -1 if no such number exists.

NOTE: A solution will always exist if the number is even. Read Goldbach’s conjecture.

If [a, b] is one solution with a <= b, and [c, d] is another solution with c <= d, and a < c then print [a, b] only
and not all possible solutions.The first line contains an integer T, depicting total number of test cases. Then following T lines contains an integer N. 

Constraints: 
1 ≤ T ≤ 100
2 ≤ N ≤ 1000000Print the two prime numbers in a single line with space in between if exist else print -1.Sample Input:
2
8
3

Sample Output:
3 5
-1, I have written this Solution Code: def isprime(num):
    if(num==1 or num==0):
        return False
    for i in range(2,int(num**0.5)+1):
        if(num%i==0):
            return False
    return True

T = int(input())
for test in range(T):
    N = int(input())
    value = -1

    if(N%2==0):
        for i in range(2,int(N/2)+1):
            if(isprime(i)):
                if(isprime(N-i)):
                    value = i 
                    break
    else:
        if(isprime(N-2)):
            value = 2

    if(value==-1):
        print(value)
    else:
        print(str(value)+" "+str(N-value)), In this Programming Language: Python, Now tell me if this Code is compilable or not?