#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
#include <bits/stdc++.h>
int k,i;
using namespace std;
int main(){
    cin>>k;
	double ans=1;
	for(i=2;ans<=k;i++){
		ans+=1.0/i;
	}
	cout<<i-1;
	return 0;
}

#include<iostream> 
using namespace std; 
int main() 
{ 
    int n,cnt=1; 
    long double sum=0; 
    cin>>n; 
    while(sum<=n) 
    { 
        sum+=1.0/cnt; 
        cnt++; 
    } 
    cout<<cnt-1; 
    return 0; 
}

#include<bits/stdc++.h>
using namespace std;
int k,i;
int main()
{
	cin>>k;
	double ans=1;
	for(i=2;ans<=k;i++)
	{
		ans+=1.0/i;
	}
	cout<<i-1;
	return 0;
}

#include using namespace std; int main(){ double k,s=0,a=0; cin>>k; while(s<=k){ a++; s=s+1/a; } cout<<a; }

#include #include <math.h> #include #include <stdio.h> #include #include #include #include <string.h> #include using namespace std; #define LL long long const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; int n,k; double s; int main() { cin>>k; while(s<=k) { n++; s+=1.0/n; } cout<<n; return 0; }

#include<iostream>
using namespace std;
int main(){
	double k,s=0,a=0;
	cin>>k;
	while(s<=k){
		a++;
		s=s+1/a;
	}
	cout<<a;
}

#include #include #include<math.h> #include using namespace std; int main() { double s = 0; int n = 0, k; cin>>k; while(s <= k) { n++; s += 1.0 / n; } cout<<n; return 0; }

#include<bits/stdc++.h>
using namespace std;
int k,i;
int main()
{
	cin>>k;
	double ans=1;
	for(i=2;ans<=k;i++)
	{
		ans+=1.0/i;
	}
	cout<<i-1;
	return 0;
}

#include using namespace std; int main() { int n,cnt=1; long double sum=0; cin>>n; while(sum<=n) { sum+=1.0/cnt; cnt++; } cout<<cnt-1; return 0; }