#include <stdio.h>
// Helper function to check if a number is prime
int isPrime(int x) {
if (x < 2) {
return 0; // Not prime
}
for (int i = 2; i * i <= x; i++) {
if (x % i == 0) {
return 0; // Not prime
}
}
return 1; // Prime
}
// Function to check if a number is a super prime
int isSuperPrime(int n) {
if (isPrime(n) == 1 && isPrime(n - 2) == 1) {
return 1; // Yes, it is a super prime
}
return 0; // No
}
int main() {
int n;
scanf("%d", &n);
if (isSuperPrime(n) == 1) {
printf("Yes\n");
} else {
printf("No\n");
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgovLyBIZWxwZXIgZnVuY3Rpb24gdG8gY2hlY2sgaWYgYSBudW1iZXIgaXMgcHJpbWUKaW50IGlzUHJpbWUoaW50IHgpIHsKICAgIGlmICh4IDwgMikgewogICAgICAgIHJldHVybiAwOyAvLyBOb3QgcHJpbWUKICAgIH0KICAgIGZvciAoaW50IGkgPSAyOyBpICogaSA8PSB4OyBpKyspIHsKICAgICAgICBpZiAoeCAlIGkgPT0gMCkgewogICAgICAgICAgICByZXR1cm4gMDsgLy8gTm90IHByaW1lCiAgICAgICAgfQogICAgfQogICAgcmV0dXJuIDE7IC8vIFByaW1lCn0KCi8vIEZ1bmN0aW9uIHRvIGNoZWNrIGlmIGEgbnVtYmVyIGlzIGEgc3VwZXIgcHJpbWUKaW50IGlzU3VwZXJQcmltZShpbnQgbikgewogICAgaWYgKGlzUHJpbWUobikgPT0gMSAmJiBpc1ByaW1lKG4gLSAyKSA9PSAxKSB7CiAgICAgICAgcmV0dXJuIDE7IC8vIFllcywgaXQgaXMgYSBzdXBlciBwcmltZQogICAgfQogICAgcmV0dXJuIDA7IC8vIE5vCn0KCmludCBtYWluKCkgewogICAgaW50IG47CiAgICBzY2FuZigiJWQiLCAmbik7CgogICAgaWYgKGlzU3VwZXJQcmltZShuKSA9PSAxKSB7CiAgICAgICAgcHJpbnRmKCJZZXNcbiIpOwogICAgfSBlbHNlIHsKICAgICAgICBwcmludGYoIk5vXG4iKTsKICAgIH0KCiAgICByZXR1cm4gMDsKfQo=