#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long 
ll power(ll a, ll b)
{
    if (b == 0) return 1;
    ll tmp = power(a, b / 2);
    ll result = tmp * tmp;
    if (b % 2 == 1)result *= a;
    return result;
}
ll binarySearch(ll left, ll right, ll key,vector<ll>v)
{
    ll mid = (right + left) / 2;
    if (left <= right)
    {

        if (key ==v[mid])
        {
            return mid;
        }
        if (v[mid]< key)
            return binarySearch(mid + 1, right, key,v);
        if (v[mid] > key)
            return binarySearch(left, mid - 1, key,v);
    }
    return mid;
}


int main() { 

    ll h, t;
    cin >> h >> t;
    cout << h / t << endl;
}