#include <bits/stdc++.h>

#define FOR(i,a,b) for (ll i=(a);i<(ll)(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define SUM(v) accumulate(ALL(v),0ll)
#define CL(v) cout<<v<<endl
using ll = long long;
const ll INF=1LL<<60;
const ll mod=1000000000+7;
using namespace std;
using P = pair<int,int>;

class UnionFind {
public:
    vector <ll> par; 
    vector <ll> siz;
 
    UnionFind(ll sz_): par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i; 
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL); 
        for (ll i = 0; i < sz_; ++i) par[i] = i; 
    }
    ll root(ll x) { 
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
      
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }
 
    bool issame(ll x, ll y) { 
        return root(x) == root(y);
    }
 
    ll size(ll x) {
        return siz[root(x)];
    }
};

int main()
{
    ll n,s;
    cin>>n>>s;
    ll mx=s;
    ll mid=s;
    if(mid>=30*n||mx<25)cout<<"No"<<endl;
    else cout<<"Yes"<<endl;
    return 0;
}