#include<iostream>
#include<vector>
using namespace std;
typedef long long LL;
const int NN = 1e6;
bool isPrime[NN];
vector<int> Primes;
void sieve() {
	fill_n(isPrime, NN, true);
	for (LL i = 2; i < NN; i++) {
		if (!isPrime[i]) continue;
		Primes.push_back(i);
		for (LL j = i * i; j < NN; j += i) isPrime[j] = false;
	}
}
int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	sieve();
	for (int n; cin >> n && n;) {
		for (int p : Primes) {
			if (isPrime[n - p]) {
				printf("%d = %d + %d\n", n, p, n - p);
				break;
			}
		}
	}
	return 0;
}