#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vc;
typedef vector<long long> vl;
typedef vector<vector<long long>> vll;
typedef __int128_t int128;
#define rep(x, y, z) for(int x = (y); x <= (z); x++)
#define per(x, y ,z) for(int x = (y); x >= (z); x--)
#define yes cout << "Yes\n"
#define no cout << "No\n"

//#define int long long
//const int N = 1e5 + 5;
//const int mod = 1e9 + 7;
//const ll inf = 1e18;


void solve(){
    int n, m; cin >> n >> m;
    set<int> s;
    s.insert(1), s.insert(4);
    rep(a, 1, 6){
        rep(b, 1, 6){
            rep(c, 1, 6){
                int cnt1 = 0, cnt2 = 0;
                if(s.count(a)) cnt1 += a;
                else cnt2 += a;
                if(s.count(b)) cnt1 += b;
                else cnt2 += b;
                if(s.count(c)) cnt1 += c;
                else cnt2 += c;
                if(cnt1 == n and cnt2 == m){
                    yes;
                    return;
                }
            }
        }
    }
    no;
}

signed main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

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