#include <bits/stdc++.h>
using namespace std;

bool p[10000019];

int main(){

    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    memset(p, 1, sizeof p);
    for(long long i = 2; i <= 10000009; ++i){
        if(p[i]){
            for(long long j = i * i; j <= 10000009; j += i)
                p[j] = 0;
        }
    }
    int n;
    while(cin >> n){
        bool found = false;
        int i, j, k;
        for(i = 2; i <= 3; ++i){
            for(j = 2; j <= 3; ++j){
                for(k = 2; k <= 3; ++k){
                    if(n - i - j - k >= 2){
                        if(p[n - i - j - k]){
                            found = true;
                            break;
                        }
                    }
                }
                if(found)
                    break;
            }
            if(found)
                break;
        }
        if(found)
            cout << i << " " << j << " " << k << " " << n - i - j - k << '\n';
        else
            cout << "Impossible.\n";
    }
    return 0;
}