#include<iostream>
#include<string>
#include<vector>
#include<set>
#include<functional>
#include<map>
#include<cmath>
#include <iterator>
#include<algorithm>
#include<queue>
#include<cstdlib>
#include<stdio.h>
#include<assert.h>
#include<sstream>
#define ff first
#define ss second
#define rep(i,a,b) for(i=a;i<b;i++)
#define uniq(v) (v).erase(unique(all(v)),(v).end())
#define pb push_back
#define pf pop_front
#define sz(x) (int)((x).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define endl "\n"
using namespace std;
#define MOD 1000000007
#define vl vector<ll>
#define vpl vector<pair<ll,ll>>
typedef  long long int ll;
template<typename T, typename T1>T amax(T& a, T1 b) { if (b > a)a = b; return a; }
template<typename T, typename T1>T amin(T& a, T1 b) { if (b < a)a = b; return a; }
/*void binpow(long long a,long long n)
{
    int res = 1;
    while (n)
    {
        if (n & 1)
        {
            res = (res * a )%MOD;
            n--;
        }
        else
        {
            a = (a * a) % MOD;
            n = n / 2;
        }
    }
    cout << res<< endl;
}*/

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    ll x; ll y;
    cin >> x >> y;
    cout << (abs(y - x )< 3 ? "Yes" : "No");
  
}
#include <bits/stdc++.h>

using namespace std;

int main()
{
   int t = 1;
   //cin>>t;
   while(t--){
       long long k;
       cin>>k;
       long long n;
       cin>>n;
       vector<long long> all;
       long long cur =0;
       for(long long i=1;i<=100;i++){
           cur+=k;
           if(cur>=100){
               all.push_back(i);
               cur-=100;
           }
       }
     
       long long es = n/all.size();
       //cout<<es<<endl;
       cur=(100*es);
       long long rem=n-es*all.size();
       if(rem!=0)
       cur+=all[rem-1];
       //cout<<cur<<endl;
       //cout<<(100+k)*cur<<endl;
       long long num = ((100+k)*cur)/100 -1;
       cout<<num<<endl;
   }
   
   return 0;
}