#include<bits/stdc++.h>
using namespace std;
const int N = 10010;
const int M = 13;
int n;
int a[N];
int f[N][M];
void ST_create() {
for (int i = 1; i <= n; i++) {
f[i][0] = a[i];
}
int k = log(k) / log(2.0);
for (int j = 1; j <= k; j++)
for (int i = 1; i <= n - (1 << j); i++) {
f[i][j] = max(f[i][j - 1], f[i + (1 << (j-1))][j - 1]);
}
}
int main() {
cout << log(10010)/log(2);
}