#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
mt19937_64 rd(time(0));
template <class key, class val = null_type, class cmp = less<>>
using rb_tree = tree<key, val, cmp, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class ... A>
void debug(const T & t, const A & ... a) { cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n"; }

void QAQ() {
    int a, b;
    cin >> a >> b;

    set<int> s1 = {1, 4};

    for (int i = 1; i <= 6; i++) {
        for (int j = 1; j <= 6; j++) {
            for (int k = 1; k <= 6; k++) {
                int t1 = 0, t2 = 0;
                if (s1.count(i)) t1 += i;
                else t2 += i;
                if (s1.count(j)) t1 += j;
                else t2 += j;
                if (s1.count(k)) t1 += k;
                else t2 += k;
                if (pair{a, b} == pair{t1, t2}) {
                    cout << "YES\n";
                    return;
                }
            }
        }
    }
    cout << "NO\n";
}

signed main() {
    int t = 1;
    // cin >> t;
    for (cin.tie(0) -> sync_with_stdio(0), cout << fixed << setprecision(12); t--; QAQ());
}