def add(a, b):
    jw = a & b
    jg = a ^ b
    while jw:
        ta = jg
        tb = jw << 1
        jw = ta & tb
        jg = ta ^ tb
    return jg

def is_p(n):
    one = ord('b') - ord('a')
    two = ord('c') - ord('a')
    three = ord('d') - ord('a')
    if n <= one:
        return False
    if n <= three:
        return True
    if not (n % two):
        return False;
    for i in xrange(three, n, two):
        if not (n % i):
            return False
    return true

n = int(raw_input())
if is_p(n):
    print "YES"
else:
    print "NO"