#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")
using namespace std;

const int mx = 1000006;
vector<int> f(mx, 1);

void calc () {
  for (int i = 2; i < mx; i++) {
    for (int j = i * i; j < mx; j += i) {
      f[j] += 1;
    }
  }
}

void solve(int cs) {
  int n;
  cin >> n;
  cout << f[n] << "\n";

}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int tc = 1; calc();
  // cin >> tc;
  for (int cs = 1; cs <= tc; cs++) {
    solve(cs);
  }
  return 0;
}