#include <bits/stdc++.h>
using namespace std;
const int cnt = 200000;
vector<int> small = {0, 1, 5, 2, 11, 6, 5, 3, 9, 12, 8, 7, 11, 6, 5, 4, 15, 10, 14, 13};
int main(){
  auto convert = [&](vector<int> &A, string s){
    if (s.empty()){
      return vector<int>(0);
    }
    reverse(s.begin(), s.end());
    int cnt = s.size();
    vector<int> P = {0};
    for (int i = 0; i < cnt - 1; i++){
      if (s[i] == '0'){
        P.back()++;
      } else {
        P.push_back(0);
      }
    }
    int cnt2 = P.size();
    vector<int> P2;
    int mx = -1;
    for (int i = 0; i < cnt2; i++){
      if (A[P[i]] >= mx){
        mx = A[P[i]];
        P2.push_back(A[P[i]]);
      }
    }
    reverse(P2.begin(), P2.end());
    return P2;
  };
  auto convert_mid_int = [&](int x){
    string s;
    while (x > 0){
      s += '0' + x % 2;
      x /= 2;
    }
    reverse(s.begin(), s.end());
    return convert(small, s);
  };
  vector<vector<int>> A(cnt);
  for (int i = 0; i < cnt; i++){
    A[i] = convert_mid_int(i);
  }
  vector<pair<vector<int>, int>> B(cnt);
  for (int i = 0; i < cnt; i++){
    B[i] = make_pair(A[i], i);
  }
  sort(B.begin(), B.end());
  vector<int> mid(cnt);
  mid[B[0].second] = 0;
  for (int i = 1; i < cnt; i++){
    mid[B[i].second] = mid[B[i - 1].second];
    if (B[i].first != B[i - 1].first){
      mid[B[i].second]++;
    }
  }
  string N;
  cin >> N;
  string M;
  cin >> M;
  if (N == "0"){
    N = "";
  }
  if (M == "0"){
    M = "";
  }
  vector<int> N2 = convert(mid, N);
  vector<int> M2 = convert(mid, M);
  if (N2 < M2){
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}