#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int main(){
  ll n;
  cin>>n;
  
  ll cnt=0,tmp,pre=-1;
  ll t=(sqrt(1+4*n)-1)/2;
  for(ll i=t+1;i*i<=n;i++){
    tmp=n/i;
    if(tmp!=pre){
      cnt++;
      pre=tmp;
    }
  }
  cnt+=t;
  if(n/pre==pre) cout<<2*cnt-1<<endl;
  else cout<<2*cnt<<endl;
 
  return 0;
}