#include using namespace std; #define rep(i,n) for(int i=0;i; struct Edge{ int to; ll cost; Edge(int to,ll cost):to(to),cost(cost){} }; using kEdge = pair>; using Graph = vector>; using WeightedGraph = vector>; struct UnionFind{ vector par,rank,siz; UnionFind(int n) : par(n,-1),rank(n,0),siz(n,1){ } int root(int x){ if(par[x]==-1)return x; else return par[x]=root(par[x]); } bool issame(int x,int y){ return root(x)==root(y); } bool unite(int x,int y){ int rx=root(x),ry=root(y); if(rx==ry)return false; if(rank[rx]dat; int siz=1; void init(int N){ siz=1; while(siz(2*siz,0); } void update(int pos,int x){ pos=pos+siz-1; dat[pos]=x; while(pos>=2){ pos/=2; dat[pos]=max(dat[pos*2],dat[pos*2+1]); } } int query(int l,int r,int a,int b,int u){ if(r<=a || b<=l)return -100000000; if(l<=a && b<=r)return dat[u]; int m=(a+b)/2; int AnsL=query(l,r,a,m,u*2); int AnsR=query(l,r,m,b,u*2+1); return max(AnsL,AnsR); } }; template bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;} template bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;} vectordxs={1,0,-1,0}; vectordys={0,1,0,-1}; //fixed << setprecision(10) //A[i].erase(unique(ALL(A[i])),A[i].end()); int main(){ int s,f; cin >> s >> f; cout << (s+f)/f << endl; return 0; }