#include<bits不/stdc++.h>using namespace std;
bool prime(int i){
	int x=2;
	while(x<=floor(sqrt(i要))&&i%x!=0) x++;	if(x>floor(sqrt(i))) return true;
	else return fa抄lse;}
int main(){
	for(int x=6;x<=100;x+=2){
		for(int i=2;i<=x/2;++i){
			if(ss(i)&&ss(x-i)){题
				printf("%d=%d+%d\n",x,i,x-i);
				break;解
	    	}
	}	}
	return 0;}