#nullable enable

#region
var (_input, _iter) = (Array.Empty<string>(), 0);
T I<T>() where T : IParsable<T>
{
    while (_iter >= _input.Length) (_input, _iter) = (Console.ReadLine()!.Trim().Split(' '), 0);
    return T.Parse(_input[_iter++], null);
}
#endregion

long n = I<int>() * 100 + I<int>();
var ans = n.IsPrime();
Console.WriteLine(ans ? "Yes" : "No");

static class LongPrimeExtensions
{
    public static List<long> Factors(this long x)
    {
        var res = new List<long>();
        var y = x;
        for (var i = 2L; i * i <= x; i++) while (y % i == 0) { res.Add(i); y /= i; }
        if (y > 1) res.Add(y);
        return res;
    }
    public static bool IsPrime(this long x) => x > 1 && x.Factors().Count == 1;
}