#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);

using namespace std;

int main(){
	double n;
	cin >> n;
	int cnt=0;
	if(n==0){
		cout << 0 << endl;
		return 0;
	}
	double temp=1;
	while(1){
		temp*=n;
		cnt++;
		if(temp<=0.5){
			break;
		}
	}
	cout << cnt << endl;
	return 0;
}