#include <iostream>
#include <vector>
#include <algorithm>
#include <iterator>
#include <array>
#include <map>
#include <stack>
#include <queue>
#include <set>

using namespace std;

long pow(long x, int n) {
    long ans = 1;
    while (n > 0) {
        if ((n & 1) == 1) {
            ans = ans * x;
        }
        x = x * x;
        n = n >> 1;
    }
    return ans;
}

long f(long x) {
    return pow(2,x);
}

int main() {

    long N;
    cin >> N;

    int k = 0;
    while (f(k) < N) {
        k += 1;
    }

    cout << k << "\n";

}