import java.util.*;
import java.lang.*;
import java.io.*;

class GFG {
    
    public static void func(int n) {
        
        boolean[] prime = new boolean[n+1];
        for(int i=2; i<=n; ++i) {
            prime[i] = true;
        }
        
        for(int p=2; p*p<=n; ++p) {
            if(prime[p]) {
                for(int k=2*p; k<=n; k+=p) {
                    prime[k] = false;
                }
            }
        }
        
        ArrayList<Integer> rs = new ArrayList<Integer> ();
        for(int i=2; i<=n; ++i) {
            if(prime[i]) {
                rs.add(i);
            }
        }
        
        for(int i=0; i<rs.size(); ++i) {
            int first = rs.get(i);
            int second = n - first;
            if(prime[first] && prime[second]) {
                System.out.println(first + " " + second);
                break;
            }
        }
    }
    
    public static void main (String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        
        for(int i=0; i<t; ++i) {
            int n = in.nextInt();
            func(n);
        }
    }
}