#pragma GCC optimize ("O3")
#include <bits/stdc++.h>
using namespace std;
const long long nmax = 1e6 + 5;
bool f[nmax+1];
void snt()
{
  memset (f , true , sizeof(f));
  f[0]=f[1]=false;
  for (long long i = 2; i <= sqrt(nmax); ++i)
  if (f[i]) for (long long j = i * i; j <= nmax; j += i)
  f[j] = false;
}
long long n, d = 0;
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);cout.tie(NULL);
  snt();
  cin >> n;
  if (n <= 4) return cout << "NO", 0;
  for (long long i = 2; i <= n; ++i)
  {
    if (f[i] and f[n-i])
    {
      cout<<i<< ' ' << n - i;
      d++;
      break;
    }
  }
  if (d == 0) cout << "NO";
}

#include <bits/stdc++.h>
using namespace std;
const int N=1e6+5;
bool prime[N];
void sieve(){
	memset(prime,true,sizeof(prime));
	prime[1]=prime[0]=false;
	for(int i=2;i<=sqrt(N-5);i++){
		if(prime[i]){
			for(int j=i*2;j<=N-5;j+=i){
				prime[j]=false;
			}
		}
	}
}
long long n;
int main() {
	sieve();
	cin >> n;
	if (n <= 4) return cout << "NO", 0;
	for (long long i = 2; i <= n; ++i) {
		if (prime[i] and prime[n-i]) {
			cout << i << " " << n - i;
			//nt = true;
			//break;
			return 0;
		}
	}
	cout<<"NO";
}