#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;
}
