#include <bits/stdc++.h>
 #define ll long long
 #define ull unsigned long long
 #define pi 3.141592654
 #define NUM 1e18
 #define Mod  1'000'000'007
 #define fixed(n) fixed<<setprecision(n)
 #define cin(v) for(auto &i:v) cin >> i ;
 #define cout(v) for(auto &i:v) cout << i  <<" ";
 #define vowel(x) (x=='e'||x=='a'||x=='i'||x=='o'||x=='u')
 #define small(x) (x>=97&&x<=122)
 #define capital(x) (x>=65&&x<=90)
 #define Tolower(s) transform(s.begin(),s.end(),s.begin(),::tolower);
 #define Toupper(s) transform(s.begin(),s.end(),s.begin(),::toupper);
 #define sz(x) (int)(x.size())
 #define all(v) ((v).begin()), ((v).end())
 #define allr(v) ((v).rbegin()), ((v).rend())
 #define updmax(a,b) a=max(a,b)
 #define updmin(a,b) a=min(a,b)
 #define ceil(a,b) ((a/b)+(a%b?1:0))
 /* asc -> 1 2 3 ,des -> 3 2 1 */

 /***********************************************************************************/
 using namespace std;
 void Rofyda_Elghadban(){
  #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
   #endif
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
 }

  __int128 read_int_128(){
  string num;
  cin>>num;
  __int128 ret=0;
  int st=0;
  if(num[0]=='-'){
    st=1;
  }
  for(int i=st;i<num.size();i++){
    ret*=10;
    ret+=(num[i]-'0');
  }
  if(num[0]=='-'){
    ret*=-1;
  }
  return ret;
 }

 string print_int_128(__int128 num){
  if(num==0){
    return "0";
  }
  string ret;
  bool neg=false;
  if(num<0){
    neg=true;
    num*=-1;
  }
  while(num){
    ret.push_back(num%10+'0');
    num/=10;
  }
  reverse(all(ret));
  if(neg){
    ret="-"+ret;
  }
  return ret;
 }

 bool prime(__int128 n){
  if(n<2){
    return false;
  }for(ll i=2;i<=n/i;i++){
    if(n%i==0){
      return false;
    }
  }
  return true;
 }

 void solve(){
  __int128 n=read_int_128(),m=read_int_128();
  n*=n;
  m*=m;
  __int128 ans=n-m;
  if(prime(ans)){
    cout<<"YES"<<"\n";
  }else{
    cout<<"NO"<<"\n";
  }
 }

 int main(){
  Rofyda_Elghadban();
  int t=1;
  // cin>>t;
  while(t--){
    solve();
  }
  return 0;
 }