#include <iostream>
using namespace std;

bool isPrime(int n) {
    if(n < 4) return true;
    for(int i = 2; i * i <= n; ++i) {
        if(n % i == 0) return false;
    }
    return true;
}

int main() {
    int n;
    cin >> n;
    int big = n / 2;
    int small = n - big;
    while(1) {
        if(isPrime(big) && isPrime(small)) {
            cout << small << endl << big << endl;
            return 0;
        }
        ++big;
        --small;
    }
    return 0;
}