///////////        
//                   //      //
//              ////////////////////
//                   //      //
//                 
///////////

//          
//          
//           //     //    ////////     /\     /////////
//           //     //   //      //          //       //
//            ////////   //      //    //    //       //
//                  //   //      //    //    //       //
//////////   ////////    //      //    //     /////////////

//#pragma GCC optimize(2)
#pragma G++ optimize(2)
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <cstring>
#include <cmath>
#include <list>
#include <stack>
#include <array>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <random>
#include <numeric>
#include <functional>
//#include <Windows.h>

using namespace std;

#define fa(i,op,n) for (int i = op; i <= n; i++)
#define fb(j,op,n) for (int j = op; j >= n; j--)
#define pb push_back
#define HashMap unordered_map
#define HashSet unordered_set
#define var auto
#define all(i) i.begin(), i.end()
#define all1(i) i.begin() + 1,i.end()
#define endl '\n'
#define px first
#define py second
#define DEBUG(a) cout<<a<<endl

using VI = vector<int>;
using VL = vector<long long>;
using ll = long long;
using ull = unsigned long long;
using db = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

template<class T1, class T2>
ostream& operator<<(ostream& out, const pair<T1, T2>& p) {
	out << '(' << p.first << ", " << p.second << ')';
	return out;
}

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& ve) {
	for (T i : ve)
		out << i << ' ';
	return out;
}

template<class T1, class T2>
ostream& operator<<(ostream& out, const map<T1, T2>& mp) {
	for (auto i : mp)
		out << i << '\n';
	return out;
}

const int INF = 0x3f3f3f3f;
const ll LNF = 0x3f3f3f3f3f3f3f3f;
const int IINF = 0x7fffffff;
const int iinf = 0x80000000;
const ll LINF = 0x7FFFFFFFFFFFFFFF;
const ll linf = 0x8000000000000000;
int dx[8] = { 1, -1, 0, 0, 1, -1, 1, -1 };
int dy[8] = { 0, 0, 1, -1, 1, -1, -1, 1 };

//#include "Lynia.h"

const int mod = 1e9 + 7;
const int N = 1e6 + 10;


void solve(int CASE)
{
	int a, b; cin >> a >> b;
	var mp = map<int, int>();
	mp = {
		{0,3},
		{1,2},
		{2,1},
		{3,0},
		{4,2},
		{5,1},
		{6,0},
		{8,1},
		{9,0},
		{12,0},
	};
	if (mp.find(a) == mp.end()) {
		cout << "No" << endl;
		return;
	}
	if (mp[a] == 3) {
		set<int> ans;
		const vector<int> ve = { 2,3,5,6 };
		fa(i, 0, ve.size() - 1)
			fa(j, 0, ve.size() - 1)
			fa(k, 0, ve.size() - 1) {
			ans.insert(ve[i] + ve[j] + ve[k]);
		}
		for (int i : ans) {
			if (i == b) {
				cout << "Yes" << endl;
				return;
			}
		}
		cout << "No" << endl;
	}
	else if (mp[a] == 2) {
		const vector<int> ans = { 4,5,7,8,9,10,11,12 };
		for (int i : ans) {
			if (i == b) {
				cout << "Yes" << endl;
				return;
			}
		}
		cout << "No" << endl;
	}
	else if (mp[a] == 1) {
		if (b == 2 or b == 3 or b == 5 or b == 6)
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
	else {
		if (b == 0)
			cout << "Yes" << endl;
		else
			cout << "No" << endl;
	}
	return;
}

int main()
{
	//SetConsoleOutputCP(CP_UTF8);
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int _ = 1;
	//cin >> _;
	fa(i, 1, _)solve(i);
	return 0;
}