#include <iostream>
#include <stdio.h>
#include <ctype.h>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <deque>
#include <string>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <map>
#include <unordered_map>
#include <bitset>
#include<numeric>
using namespace std;

#define _crt_secure_no_warnings
#define _USE_MATH_DEFINES
#define FREELO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define pb push_back
#define all(v) v.begin(), v.end()
#define M_PI 3.14159265358979323846
#define INF 0x3F3F3F3F3F3F3F3F
#define MAX 1001
#define MOD
#define sz(s) s.size()
#define ALPHABET 128
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define for0(i, n) for (int i = 0; i < (n); i++)
#define F first
#define S second
typedef long long ll;
typedef double lf;
typedef pair<int, int> ii;


int main(void) {
    int n; cin >> n;
    int w; cin >> w;
    cout << n / w;
}

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

typedef long long LL;
typedef pair<int, int> PII;
const int mod = 1e9 + 7;
const int inf = 2147483647;
const int N = 5e4 + 10, M = N * 2 * 17;

void solve() {
    int n, w;
    scanf("%d%d", &n, &w);
    printf("%d\n", n / w);
}

int main() {
    // freopen("in.txt", "r", stdin);
    // int t; cin >> t; while(t--)
    solve();
    return 0;
}
