0分求调

using namespace std;
bool gs(int a) {
	for (int i = sqrt(a); i >= 2; i--) {
		if (a % i == 0) {
			return 0;
		}
	}
	return 1;
}
int main() {
	int n, k = 0;
	cin >> n;
	for (int j = n; j >= 4; j--) {
		for (int i = 2; i <= n - k - 1; i++) {
			if (gs(i) == 1 && gs(n - k - i) == 1) {
				cout << n - k << "=" << i << "+" << - k - i;
				break;
			}
		}
		j--;
		k += 2;
		cout << endl;
	}
	return 0;
} ```