/*
power code taken from geeks for geeks

*/

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;

// THINGS TO REMEMBER
// ENDL is slow, '\n' is fast
// Clear everything (including graphs) between test cases
// use anti-anti-hash: https://codeforces.com/blog/entry/62393
// pb-ds: https://codeforces.com/blog/entry/11080
// check when to use LLONG_MAX/LLONG_MIN vs INT_MAX or INT_MIN
// You frequently suffer from confirmation bias - you trust your initial solution and miss simple things. 
// When you hit a roadblock, remember to rethink the solution ground up, not just try hacky fixes


#define flush fflush(stdout);
#define PLL pair<ll,ll>
const ll INF = 1e18 + 5;
const ll MAX_N = 2e5 + 5;
const ll MODD = 1e9 + 7;
const ll MAX_M = 5e3 + 5;


ll max(ll a,ll b){return a>b?a:b;}
ll min(ll a,ll b){return a<b?a:b;}
double max(double a,double b){return a>b?a:b;}
double min(double a,double b){return a<b?a:b;}
ld max(ld a,ld b){return a>b?a:b;}
ld min(ld a,ld b){return a<b?a:b;}

ll modd(ll a){if(a<0LL) return a*-1LL;return a;}
double modd(double a){if(a<0.0) return a*-1.0;return a;}

ll modulo(ll a){
    ll ans = a;
    while(ans < 0LL) {
        ans += MODD;
    }
    return (a + MODD) % MODD;
}

ll power(ll k, ll p){
    if (p == 0)
        return 1LL;
 
    ll P = power(k, p/2LL);
    P = modulo((P * P));
 
    if (p % 2 == 1)
        P = modulo((P * k));
 
    return P;
}
int iii = 0;void _debug() {cout << "here " << (iii++) << endl;}



void solve() {
    ll n, w;
    cin >> n >> w;
    cout << n / w << endl;
}


int main() {




    ios_base::sync_with_stdio(false);
    cin.tie(NULL);


    
    ll t = 1;
    
    // cin >> t;
    

    while(t--){
        solve();
    }

    return 0;
}
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
const int mod=1e9+7;
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int a,b;
	cin>>a>>b;
	cout<<2*a+100-b<<"\n";
	return 0;
}
