#include <iostream>
using namespace std;

bool isP(int n) {
	if (n <= 1)return false;
	for (int i = 2; i <=sqrt(n); i++) {
		if (n % i == 0)
			return false;
	}
	return true;
}

int isSexyPrime(int n) {

	if (isP(n) == true) {
		if (isP(n - 6) == true) return n - 6;
		if (isP(n + 6) == true) return n + 6;
	}
	return -1;
}

int main() {

	int n;
	cin >> n;
	int ans = isSexyPrime(n);
	if(ans!=-1)cout << "Yes\n" << ans;
	else {
		while (isSexyPrime(++n) == -1);
		cout << "No\n"<<n;
	}
	return 0;
}
复制