#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
const int M = (int)3e5;
long long dp[M+1];
void solve()
{
	for(int i = 1;i <= M;i++) dp[i] = (long long)1e18;
	dp[1] = 0;
	for(int i = 1;i <= M;i++)
	{
		for(int j = i+i;j <= M;j += i) dp[j] = min(dp[j],dp[i]+j/i);
	}
	int N;
	cin >> N;
	cout << dp[N] << "\n";
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}