#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

#define X first
#define Y second
#define ll long long
#define ull unsigned long long
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define ordered_set tree<pii, null_type,less<pii>, rb_tree_tag,tree_order_statistics_node_update>
#define pf(a) cout<<"checking-- "<<a<<endl
#define pff(a,b) cout<<"Checking-- "<<a<<' '<<b<<endl
#define pfff(a,b,c) cout<<"Checking-- "<<a<<' '<<b<<' '<<c<<endl
#define clr(ar) memset(ar,0,sizeof(ar))
#define gP(n) (prime[n>>6]&(1<<((n>>1)&31)))
#define sP(n) (prime[n>>6]=prime[n>>6]|(1<<((n>>1)&31)))
#define on(val,pos) (val|(1<<pos))
#define off(val,pos) (val&(~(1<<pos)))
#define check(val,pos) (val&(1<<pos))
#define invert(val,pos) (val^(1<<pos))
#define INF (ll) 1e18
#define pie (double)acos(-1.0)
#define vsort(v) sort(v.begin(),v.end())
#define arsort(v,n) sort(v,v+n)
#define MAX 100004
#define MOD 1000000007
vector<tuple<int,int,int>> edges;


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

}
int main(){
    int tst=1;
    while(tst--){
        solve();
    }

    return 0;
}


#include<iostream>
#include<bits/stdc++.h>
#include<cmath>
#include<vector>
#include<iterator>
#include<set>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<list>
#include<algorithm>
#include<sstream>
#define PI acos(-1)
typedef long long ll;
#define V(dt) vector<dt>
#define S(dt) set<dt>
#define L(dt) list<dt>
#define M(dt1,dt2) map<dt1,dt2>
#define ST(dt) stack<dt>
#define Q(dt) queue<dt>
#define DQ(dt) deque<dt>
#define I ::iterator
#define P(dt1,dt2) pair<dt1,dt2>
#define VP(dt1,dt2) vector< pair<dt1,dt2> >
#define A int ii,tt; cin>>tt; for(ii=0;ii<tt;ii++)
#define IOS ios::sync_with_stdio(false); cin.tie(0);cout.tie(0);
#define INTMAX 2147483647
#define INTMIN -2147483648
//int sum=0;
using namespace std;
int main()
{
    int n,w;
    cin>>n>>w;
    for(int i=1;;i++){
        if((i*w)==n){
            cout<<i<<endl;
            return 0;
        }
        if((i*w)>n){
            cout<<i-1<<endl;
            return 0;
        }
    }


}
