#include<vector>
#include <stdlib.h>
#include<math.h>
#include <unordered_map>
#include<algorithm>
#include<iostream>
using namespace std;

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

int main(){
	int c = 0;
	int p[10001] = { 0 };
	for (int i = 2; i < 10001; i++){
		if (is_prime(i)){
			p[c] = i;
			c++;
		}
	}
	int n;
	cin >> n;
	int t = (n - 2) / 2;
	int m = 4;
	int k;
	for (int i = 0; i < t; i++){
		c = 0;
		k = m - p[c];
		while (!is_prime(k)){
			c++;
			k = m - p[c];
		}
		printf("%d=%d+%d\n", m, p[c], k);
		m += 2;
	}
	

	return 0;
}