        import java.util.Scanner;
         
        public class Main {
            static int binarySearchRightMost(int arr[],int key){
                int l=0,r=arr.length-1;
                while (l<r){
                    int mid=Math.floorDiv(l+r,2);
                    if(arr[mid]>key){
                        r=mid;
                    }
                    else{
                        l=mid+1;
                    }
                }
                return r-1;
         
            }
         
            public static void main(String[] args) {
        //        int arr[]={1,2,3,4,4,4,6,7};
        //        System.out.println(binarySearchRightMost(arr,4));
                Scanner scanner=new Scanner(System.in);
                int a=scanner.nextInt();
                int b=scanner.nextInt();
                System.out.println(a%b==0?Math.floorDiv(a,b):Math.floorDiv(a,b)+1);
            }
        }
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz