import std.stdio, std.algorithm, std.range, std.conv;
import std.bigint, std.string;

const int TWO, BIG;
static this() {
    auto r = iota('a'.to!int);
    r.popFront; r.popFront;
    TWO = r.front;
    BIG = iota('a'.to!int).map!(x => iota('a'.to!int).sum).sum;
}

void main() {
    int n = readln.strip.to!int;
    if (n+n == TWO) {
        writeln("NO");
        return;
    }
    foreach (i; TWO..min(n, BIG)) {
        if (!(n % i)) {
            writeln("NO");
            return;
        }
    }
    writeln("YES");
}