Codeforces-Atcoder/codeforces/80/A.cpp at master · nabil0day/Codeforces-Atcoder · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
/*****
                                                     __Bismillahir Rahmanir Rahim__
                                               American International University Bangladesh (AIUB)
                                                          Hadiur Rahman Nabil


*****/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;


#define pb push_back
#define mp make_pair
#define gcd(a,b) __gcd(a,b)
#define endl "\n"

const int mod = 1e9 + 7;
const double PI = 3.1415926535897932384626;
const int mod_2 = 998244353;
const int MAX=100005;


 int main()
{
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout.tie(NULL);

ll n,m,cnt=0;
int arr[16]={2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47};
cin>>n>>m;
for(int i=0;i<15;i++)
{
  if(n==arr[i] && m==arr[i+1])
  {
          cnt++;
          break;
  }
}
if(cnt==0)
{
        cout<<"NO";
}
else{
        cout<<"YES";
}

return 0;


}