import java.util.*;
import java.io.*;
public class Main{
/// functions
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);}
static long Modpow(long a,long p,long m){if(p==1){return a;}long x=Modpow(a,p/2,m);x=(x*x)%m;return (p&1l)!=0? (x*a)%m:x;}
static long Modmul(long a,long b,long m){return ((a%m)*(b%m))%m;}
static long ModInv(long a,long m){return Modpow(a,m-2,m);}
static long nck(int n,int r,long m){if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);}
// end
static long[] f;
static long help(long k){
	if(k<=1){return 1;}
	long x=help(k/2);
	return 2*x+1;
}
public static void main(String[] args) throws FileNotFoundException, IOException{
       Scanner s=new Scanner(System.in);
       StringBuilder sb=new StringBuilder();
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       int h=s.nextInt(),n=s.nextInt();
       int k=(int)Math.ceil((double)h/n);
        out.write(k+"");
        out.flush();
  }
} import java.util.*; util.* java import java.io.*; io.* java public class Main{
/// functions
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);}
static long Modpow(long a,long p,long m){if(p==1){return a;}long x=Modpow(a,p/2,m);x=(x*x)%m;return (p&1l)!=0? (x*a)%m:x;}
static long Modmul(long a,long b,long m){return ((a%m)*(b%m))%m;}
static long ModInv(long a,long m){return Modpow(a,m-2,m);}
static long nck(int n,int r,long m){if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);}
// end
static long[] f;
static long help(long k){
	if(k<=1){return 1;}
	long x=help(k/2);
	return 2*x+1;
}
public static void main(String[] args) throws FileNotFoundException, IOException{
       Scanner s=new Scanner(System.in);
       StringBuilder sb=new StringBuilder();
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       int h=s.nextInt(),n=s.nextInt();
       int k=(int)Math.ceil((double)h/n);
        out.write(k+"");
        out.flush();
  }
} Main // end
static long[] f; f /// functions
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);} gcd {if(b==0){return a;}return gcd(b,a%b);} if(b==0){return a;} b==0 b 0 {return a;} return a; a return gcd(b,a%b); gcd(b,a%b) gcd b a%b a b long a a long b b static long Modpow(long a,long p,long m){if(p==1){return a;}long x=Modpow(a,p/2,m);x=(x*x)%m;return (p&1l)!=0? (x*a)%m:x;} Modpow {if(p==1){return a;}long x=Modpow(a,p/2,m);x=(x*x)%m;return (p&1l)!=0? (x*a)%m:x;} if(p==1){return a;} p==1 p 1 {return a;} return a; a long x=Modpow(a,p/2,m); x Modpow(a,p/2,m) Modpow a p/2 p 2 m x=(x*x)%m x (x*x)%m (x*x) x x m return (p&1l)!=0? (x*a)%m:x; (p&1l)!=0? (x*a)%m:x (p&1l)!=0 (p&1l) p 1l 0 (x*a)%m (x*a) x a m x long a a long p p long m m static long Modmul(long a,long b,long m){return ((a%m)*(b%m))%m;} Modmul {return ((a%m)*(b%m))%m;} return ((a%m)*(b%m))%m; ((a%m)*(b%m))%m ((a%m)*(b%m)) (a%m) a m (b%m) b m m long a a long b b long m m static long ModInv(long a,long m){return Modpow(a,m-2,m);} ModInv {return Modpow(a,m-2,m);} return Modpow(a,m-2,m); Modpow(a,m-2,m) Modpow a m-2 m 2 m long a a long m m static long nck(int n,int r,long m){if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);} nck {if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);} if(r>n){return 0l;} r>n r n {return 0l;} return 0l; 0l return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m); Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m) Modmul f[n] f n ModInv(Modmul(f[n-r],f[r],m),m) ModInv Modmul(f[n-r],f[r],m) Modmul f[n-r] f n-r n r f[r] f r m m m int n n int r r long m m static long help(long k){
	if(k<=1){return 1;}
	long x=help(k/2);
	return 2*x+1;
} help {
	if(k<=1){return 1;}
	long x=help(k/2);
	return 2*x+1;
} if(k<=1){return 1;} k<=1 k 1 {return 1;} return 1; 1 long x=help(k/2); x help(k/2) help k/2 k 2 return 2*x+1; 2*x+1 2*x 2 x 1 long k k public static void main(String[] args) throws FileNotFoundException, IOException{
       Scanner s=new Scanner(System.in);
       StringBuilder sb=new StringBuilder();
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       int h=s.nextInt(),n=s.nextInt();
       int k=(int)Math.ceil((double)h/n);
        out.write(k+"");
        out.flush();
  } main {
       Scanner s=new Scanner(System.in);
       StringBuilder sb=new StringBuilder();
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       int h=s.nextInt(),n=s.nextInt();
       int k=(int)Math.ceil((double)h/n);
        out.write(k+"");
        out.flush();
  } Scanner s=new Scanner(System.in); s new Scanner(System.in) StringBuilder sb=new StringBuilder(); sb new StringBuilder() BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out)); out new BufferedWriter(new OutputStreamWriter(System.out)) int h=s.nextInt() h s.nextInt() s.nextInt s n=s.nextInt(); n s.nextInt() s.nextInt s int k=(int)Math.ceil((double)h/n); k (int)Math.ceil((double)h/n) Math.ceil Math (double)h/n (double)h n out.write(k+"") out.write out k+"" k "" out.flush() out.flush out String[] args args public class Main{
/// functions
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);}
static long Modpow(long a,long p,long m){if(p==1){return a;}long x=Modpow(a,p/2,m);x=(x*x)%m;return (p&1l)!=0? (x*a)%m:x;}
static long Modmul(long a,long b,long m){return ((a%m)*(b%m))%m;}
static long ModInv(long a,long m){return Modpow(a,m-2,m);}
static long nck(int n,int r,long m){if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);}
// end
static long[] f;
static long help(long k){
	if(k<=1){return 1;}
	long x=help(k/2);
	return 2*x+1;
}
public static void main(String[] args) throws FileNotFoundException, IOException{
       Scanner s=new Scanner(System.in);
       StringBuilder sb=new StringBuilder();
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       int h=s.nextInt(),n=s.nextInt();
       int k=(int)Math.ceil((double)h/n);
        out.write(k+"");
        out.flush();
  }
} public class Main{
/// functions
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);}
static long Modpow(long a,long p,long m){if(p==1){return a;}long x=Modpow(a,p/2,m);x=(x*x)%m;return (p&1l)!=0? (x*a)%m:x;}
static long Modmul(long a,long b,long m){return ((a%m)*(b%m))%m;}
static long ModInv(long a,long m){return Modpow(a,m-2,m);}
static long nck(int n,int r,long m){if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);}
// end
static long[] f;
static long help(long k){
	if(k<=1){return 1;}
	long x=help(k/2);
	return 2*x+1;
}
public static void main(String[] args) throws FileNotFoundException, IOException{
       Scanner s=new Scanner(System.in);
       StringBuilder sb=new StringBuilder();
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       int h=s.nextInt(),n=s.nextInt();
       int k=(int)Math.ceil((double)h/n);
        out.write(k+"");
        out.flush();
  }
} Main
import java.util.*;
import java.io.*;
public class Main{
/// functions
static long gcd(long a,long b){if(b==0){return a;}return gcd(b,a%b);}
static long Modpow(long a,long p,long m){if(p==1){return a;}long x=Modpow(a,p/2,m);x=(x*x)%m;return (p&1l)!=0? (x*a)%m:x;}
static long Modmul(long a,long b,long m){return ((a%m)*(b%m))%m;}
static long ModInv(long a,long m){return Modpow(a,m-2,m);}
static long nck(int n,int r,long m){if(r>n){return 0l;}return Modmul(f[n],ModInv(Modmul(f[n-r],f[r],m),m),m);}
// end
static long[] f;
static long help(long k){
	if(k<=1){return 1;}
	long x=help(k/2);
	return 2*x+1;
}
public static void main(String[] args) throws FileNotFoundException, IOException{
       Scanner s=new Scanner(System.in);
       StringBuilder sb=new StringBuilder();
       BufferedWriter out=new BufferedWriter(new OutputStreamWriter(System.out));
       int h=s.nextInt(),n=s.nextInt();
       int k=(int)Math.ceil((double)h/n);
        out.write(k+"");
        out.flush();
  }
}
