#include <bits/stdc++.h>
#define rep for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int solve() {
  ll n, s;
  cin >> n >> s;
  if (s < 25) return false;
  if (29 * n < s) return false;
  return true;
}

int main() {
  if (solve()) cout << "Yes" << endl;
  else cout << "No" << endl;
  return 0;
}