// http://acm.timus.ru/problem.aspx?space=1&num=1356
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <time.h>// http://en.wikipedia.org/wiki/Prime_number_theorem
#define PRIME_MAX 10000
#define PRIME_COUNT 1229typedef unsigned long long U8;
typedef char bool;const bool true = 1;
const bool false = 0;// http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
bool* getSieve(int max)
{static bool sieve[(PRIME_MAX >> 1) + 1];int i, j, imax = sqrt(max);for (i = 3; i <= imax; i += 2)if (!sieve[i >> 1])for (j = i * i; j <= max; j += i << 1) sieve[j >> 1] = true;return sieve;
}int* getPrimes(int max)
{static int primes[PRIME_COUNT + 1];bool *sieve = getSieve(max);int i, j = 0;for (primes[j++] = 2, i = 3; i <= max; i += 2)if (!sieve[i >> 1]) primes[j++] = i;return primes;
}U8 modMultiply(U8 a, U8 b, U8 m)
{return a * b % m;
}U8 modPow(U8 a, U8 b, U8 m)
{U8 v = 1, p;for (p = a % m; b > 0; b >>= 1, p = modMultiply(p, p, m))if (b & 1) v = modMultiply(v, p, m);return v;
}bool witness(U8 a, U8 n)
{U8 n1 = n - 1, s2 = n1 & -n1, x = modPow(a, n1 / s2, n);if (x == 1 || x == n1) return false;for (; s2 > 1; s2 >>= 1){x = modMultiply(x, x, n);if (x == 1) return true;if (x == n1) return false;}return true;
}U8 random(U8 high)
{// http://www.cppreference.com/wiki/c/other/randreturn (U8)(high * (rand() / (double)RAND_MAX));
}// http://en.wikipedia.org/wiki/Miller-Rabin_primality_test
// n, an integer to be tested for primality
// k, a parameter that determines the accuracy of the test
bool probablyPrime(U8 n, int k)
{if (n == 2 || n == 3) return 1;if (n < 2 || n % 2 == 0) return 0;while (k-- > 0) if (witness(random(n - 3) + 2, n)) return false;return true;
}bool isPrime(int n)
{return probablyPrime(n, 2);
}int outEven(int primes[], int n)
{int i, p, q;for (i = 0; (p = primes[i]) != 0; i++)if (isPrime(q = n - p))return printf("%d %d", p, q);return printf("error:%d", n);
}int main(void)
{int t, n, *primes = getPrimes(PRIME_MAX);srand(time(NULL));scanf("%d", &t);while (t-- > 0){scanf("%d", &n);if (isPrime(n)) printf("%d", n);else if ((n & 1) == 0) outEven(primes, n);else if (isPrime(n - 2)) printf("2 %d", n - 2);else printf("3 "), outEven(primes, n - 3);puts("");}return 0;
}