#include using namespace std; using ll = long long; #define rep(i, s, n) for (int i = (s); i < (int)(n); i++) #define rep2(i, n, s) for (int i = (n - 1); i >= (s); i--) template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } ll p(ll a, ll m, ll mod = 0){ if (!mod) { if (m == 0) return 1; if (m % 2 == 0) return p(a * a, m / 2); return p(a * a, m / 2) * a; } else { if (m == 0) return 1; if (m % 2 == 0) return p(1L * a * a % mod, m / 2, mod); return p(1L * a * a % mod, m / 2, mod) * a % mod; } } ll INF = 1000000000000000000; // rep(i, 0, 4) => 上下左右, rep(i, 0, 8) => 斜めも含む vector dy = {-1, 0, 1, 0, -1, -1, 1, 1}; vector dx = {0, 1, 0, -1, -1, 1, 1, -1}; int main() { int N; cin >> N; vector V; ll c = 1; rep(i, 0, 30) { V.push_back(c); c *= 2; } rep(i, 0, 30) { if (N <= V[i]) { cout << i << endl; return 0; } } }