#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define lowbit(i) ((i) & -(i))
#define ull unsigned long long
#define int long long
using namespace std;
const int mod = 1e9 + 7;
set<pair<int, int>> s;
int xx[7] = {0, 1, 0, 0, 4, 0, 0};
int yy[7] = {0, 0, 2, 3, 0, 5, 6};
int x, y;
void dfs(int i)
{
    if (i == 4)
    {
        s.insert({x, y});
        return;
    }
    for (int j = 1; j <= 6; j++)
    {
        x += xx[j], y += yy[j];
        dfs(i + 1);
        x -= xx[j], y -= yy[j];
    }
}
void solve()
{
    int a, b;
    cin >> a >> b;
    dfs(1);
    if (s.find({a, b}) != s.end())
    {
        cout << "Yes\n";
    }
    else
    {
        cout << "No\n";
    }
}
signed main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int tt = 1;
    // cin >> tt;
    while (tt--)
    {
        solve();
    }
}