/*
17/10/2017
*/
#include <bits/stdc++.h>
#define ll long long
#define mod 1e9 + 7
using namespace std;
int main()
{
    int a,b;
    cin>>a>>b;
    cout<<a/b<<endl;
}
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <ctype.h>
#include <iomanip>  
#include <math.h>
#include <cmath>
using namespace std;
typedef long long int ll;
typedef unsigned long long lls;



int main()
{

    //129a
    /*int n;
    cin >> n;

    int contP(0);
    int contImp(0);
    int num;

    for(int i = 0; i < n; i++)
    {
        cin >> num;
        if(num % 2 == 0)
        {
            contP++;
        }
        else
        {
            contImp++;
        }
    }

    //RES

    int res(0);
    

    if(/*contImp > 2 &&// contImp % 2)
    {
        res += contImp;
    }
    else
    {
        res += contP;
    }
    

    cout << res;*/

    //ATCODER 182

    int a, b;
    cin >> b >> a;

    cout <<  ((2*b) + 100) - a;
    


    return 0;
}