#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const int MIN = -1e9, MAX = 1e9, MOD = 1e9 + 7;
void yes() {
  cout << "YES\n";
  return;
}
void no() {
  cout << "NO\n";
  return;
}
void out(long long int n) {
  cout << n << endl;
  return;
}
void outs(string str) {
  cout << str << endl;
  return;
}
void init() {}
void solve(int case_no) {
  string a, b;
  cin >> a >> b;
  int al = a.length(), bl = b.length();
  int cnt[2] = {0, 0};
  for (int i = 0; i < al; i++) {
    if (a[i] == '1') cnt[0]++;
  }
  for (int i = 0; i < bl; i++) {
    if (b[i] == '1') cnt[1]++;
  }
  if (cnt[0] + (cnt[0] % 2) < cnt[1])
    return no();
  else
    return yes();
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  srand(time(NULL));
  init();
  int t = 1;
  for (int i = 1; i <= t; i++) solve(i);
}
