#include <iostream>
#include <cstdio>
#include <vector>
#include <map>
#include <queue>
#include <string>
#include <algorithm>

#define REP(i, n) for(ll i = 0; i < (n); i++)
#define INF 1e16
#define MOD 1e9 + 7

using namespace std;
using ll = long long;



int main() {
	string s1, s2;
	cin >> s1 >> s2;
	ll n = (s1[s1.size() - 1] - '0') % 2;
	ll m = 0;
	bool ten = false;
	REP(i, s2.size()) {
		m *= 10;
		m += s2[i] - '0';
		if (m >= 10) {
			ten = true;
		}
		m %= 100;
	}
	if (n == 1) {
		m -= 10;
		if (!ten) {
			cout << "No" << endl;
			return 0;
		}
		if (m < 0) {
			m += 100;
		}
	}
	if (m % 2 == 0) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}