T(17-9)

#include <iostream>

using namespace std;

int Putere(int n)
{
    int k = 0;
    for(int i = 1; i <= n; i *= 2)
        k++;
    return k-1;
}

int Divizor(int n, int p)
{
    int k = 0;
    int nr = 0;
    for(int i = 1; i <= n; i *= p)
    {
        if(n % i == 0)
            nr = k;
        k++;
    }
    return nr;
}

int Zerouri(int n)
{
    int nr = 0;
    while(n % 10 == 0)
    {
        nr++;
        n /= 10;
    }
    return nr;
}

int main()
{
    int n;
    cin >> n;
    cout << Putere(n) << "\n\n";

    int p;
    cin >> n >> p;
    cout << Divizor(n, p) << "\n\n";

    cin >> n;
    cout << Zerouri(n);

    return 0;
}