10168

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

// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")

typedef unsigned long long ull;
typedef long long          ll;
typedef long double        lld;
typedef vector<int>        vi;
typedef vector<ll>         vll;
typedef vector<vi>         vvi;
typedef pair<int,int >     pii;
typedef vector< pii >      vpii;
typedef set<int>           sti;

#define sc                 scanf
#define pf                 printf
#define sci(n)             scanf("%d",&n)
#define scii(n,m)          scanf("%d %d",&n,&m)
#define scl(n)             scanf("%lld",&n)
#define scd(n)             scanf("%lf",&n)
#define scs(s)             scanf("%s",s)
#define pfi(n)             printf("%d",n)
#define pfl(n)             printf("%lld",n)
#define pff(n)             cout<<n
#define spc                printf(" ")
#define line               printf("\n")
#define loop(i,x,y)        for(int i=int(x); i<=int(y); i++)
#define rloop(i,y,x)       for(int i=int(y); i>=int(x); i--)
#define cspf(i)            printf("Case %d: ", i)
#define vout(v)            for(int w=0;w<v.size();w++){if(w) cout<<' '; cout<<v[w];}
#define clr(a,x)           memset(a,x,sizeof(a))
#define tp(v,j)            get<j>(v)
#define pb                 push_back
#define mp                 make_pair
#define mt                 make_tuple
#define ff                 first
#define ss                 second
#define all(v)             v.begin(),v.end()
#define rall(v)            v.rbegin(),v.rend()
#define read()             freopen("input.txt", "r", stdin)
#define write()            freopen("output.txt", "w", stdout)
#define fastIO()           ios_base::sync_with_stdio(false); cin.tie(NULL);
/// Constants
#define eps                1e-6
#define PI                 acos(-1.0)  // 3.1415926535897932
#define MAX                (ll)2147483647
#define MAXn               (ll)10000001

int GCD(int a, int b) { return b == 0 ? a : GCD(b , a % b); }
ll LCM(ll a, ll b) { return a * (b/GCD(a, b)); }

bool isprime[MAXn+1];
vll primes;

void seive()
{
    clr(isprime,true);
    isprime[0]=false;
    isprime[1]=false;
    for(int i=4;i<MAXn;i+=2) isprime[i]=false;
    for(int i=3;i*i<MAXn;i+=2){
        if(!isprime[i]) continue;
        for(int j=i*i;j<MAXn;j+=2*i) isprime[j]=false;
    }

    primes.pb(2LL);
    for(int i=3;i<MAXn;i+=2){
        if(isprime[i]) primes.pb((ll)i);
    }
}


int main()
{
    #ifdef VAMP
        clock_t tStart = clock();
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif

    seive();
    ll x;
    while(~scl(x)){
        if(x<8LL) pf("Impossible.\n");
        else{
            bool f=false;
            ll a,b,c,d;
            if(x%2LL==0LL) a=b=2LL;
            else a=2LL,b=3LL;
            x-=(a+b);
            for(int i=0;primes[i]<x;i++){
                ll y = x-primes[i];
                if(isprime[y]){
                    c=primes[i];
                    d=y;
                    f=true;
                    break;
                }
            }
            if(f) pf("%lld %lld %lld %lld\n",a,b,c,d);
            else pf("Impossible.\n");
        }
    }


    #ifdef VAMP
        fprintf(stderr, "\n>> Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif

    return 0;
}