def sieve_of_eratosthenes(n):
    """
    エラトステネスのふるいを使ってnまでの素数をリスト化する関数
    """
    primes = [True] * (n + 1)
    primes[0] = primes[1] = False
    
    for i in range(2, int(n**0.5) + 1):
        if primes[i]:
            for multiple in range(i*i, n + 1, i):
                primes[multiple] = False
                
    prime_numbers = [i for i, is_prime in enumerate(primes) if is_prime]
    return prime_numbers

# 100,000までの素数を取得
prime_list = sieve_of_eratosthenes(1231)

M, D = map(str, input().split())
if len(D)==1:
    R = ''+M+'0'+D
else:
    R = ''+M+D
for a in prime_list:
    if a==int(R):
        print('Yes')
        exit()
print('No')