#include <bits/stdc++.h>
#if __has_include(<cpp-dump/cpp-dump.hpp>)
#include <cpp-dump/cpp-dump.hpp>
#endif
using namespace std;
using ll = int64_t;
#define all(a) a.begin(), a.end()
#define rep(i, s, e) for (ll i = s; i < e; ++i)
#define asort(a) stable_sort(all(a))
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) reduce(all(a))
constexpr double degrees(double a) { return (a * 180.0) / numbers::pi; }
constexpr double radians(double a) { return (a * numbers::pi) / 180.0; }

bool isPrime(ll n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;

  double sqrtn = sqrt(n);
  for (int i = 3; i <= sqrtn; i += 2) {
    if (!n % i)
      return false;
  }
  return true;
}

int main(int, [[maybe_unused]] char* argv[]) {
#ifdef DEBUG
  freopen(argv[1], "r", stdin);
#endif

  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);

  string M, D;
  cin >> M >> D;
  D.insert(0, 2 - D.length(), '0');

  int num = stoi(M + D);
  if (isPrime(num))
    println("Yes");
  else
    println("No");

  return 0;
}