import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int r = sc.nextInt();
        int count = 0;

        System.out.println(recursive(n,r,count));
    }

    public static int recursive(int n, int r, int count) {

        if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        }
    }


} import java.util.*; util.* java public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int r = sc.nextInt();
        int count = 0;

        System.out.println(recursive(n,r,count));
    }

    public static int recursive(int n, int r, int count) {

        if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        }
    }


} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int r = sc.nextInt();
        int count = 0;

        System.out.println(recursive(n,r,count));
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int r = sc.nextInt();
        int count = 0;

        System.out.println(recursive(n,r,count));
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int r = sc.nextInt(); r sc.nextInt() sc.nextInt sc int count = 0; count 0 System.out.println(recursive(n,r,count)) System.out.println System.out System System.out recursive(n,r,count) recursive n r count String[] args args public static int recursive(int n, int r, int count) {

        if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        }
    } recursive {

        if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        }
    } if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        } n / r == 0 n / r n r 0 {
            count++;
            return count;
        } count++ count return count; count {
            count++;
            return recursive(n/r,r,count);
        } count++ count return recursive(n/r,r,count); recursive(n/r,r,count) recursive n/r n r r count int n n int r r int count count public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int r = sc.nextInt();
        int count = 0;

        System.out.println(recursive(n,r,count));
    }

    public static int recursive(int n, int r, int count) {

        if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        }
    }


} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int r = sc.nextInt();
        int count = 0;

        System.out.println(recursive(n,r,count));
    }

    public static int recursive(int n, int r, int count) {

        if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        }
    }


} Main
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int r = sc.nextInt();
        int count = 0;

        System.out.println(recursive(n,r,count));
    }

    public static int recursive(int n, int r, int count) {

        if (n / r == 0) {
            count++;
            return count;
        }

        else {
            count++;
            return recursive(n/r,r,count);
        }
    }


}
