#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool prime(ll x){
    if(x < 2) return false;
    for(ll i = 2; i * i <= x; i++)
        if(x % i == 0) return false;
    return true;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    string n;
    ll y;
    cin >> n >> y;
    ll s = 0;
    for(char c : n) s += c - '0';
    ll a = 0, tmp = y;
    while(tmp){
        a += tmp % 10;
        tmp /= 10;
    }
    ll r = 0;
    int len = n.size();
    if(len == 1){
        r = n[0] - '0';
    } else {
        r = (n[1] - '0') * 10 + (n[0] - '0');
    }
    ll x0 = s + (a % 10);
    ll y0 = (r + a) % 100;
    double x = 21.268443;
    double y1 = 105.204557;
    double d = sqrt((x0 - x)*(x0 - x) + (y0 - y1)*(y0 - y1));
    ll k = (ll)floor(d);
    cout << (prime(k) ? "YES" : "NO");
}
//Author:PhuocThien.