#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>    // tree
#include <ext/pb_ds/tree_policy.hpp>        // tree
/* // 多倍長整数
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using Bint = cpp_int;
*/
using namespace std;
using namespace __gnu_pbds;                 // tree
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vl = vector<long long>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vd = vector<double>;
using vld = vector<long double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
using vvc = vector<vector<char>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
using vvd = vector<vector<double>>;
using vvld = vector<vector<long double>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<long long>>>;
using vvvc = vector<vector<vector<char>>>;
using vvvs = vector<vector<vector<string>>>;
using vvvb = vector<vector<vector<bool>>>;
using vvvd = vector<vector<vector<double>>>;
using vvvld = vector<vector<vector<long double>>>;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<long long, long long>>;
using vpcc = vector<pair<char, char>>;
using vpss = vector<pair<string, string>>;
using sti = set<int>;
using stl = set<long, long>;
using stc = set<char>;
using sts = set<string>;
using primax_int = priority_queue<int>;
using primin_int = priority_queue<int, vector<int>, greater<int>>;
using primax_ll = priority_queue<ll>;
using primin_ll = priority_queue<ll, vector<ll>, greater<ll>>;
using primax_char = priority_queue<char>;
using primin_char = priority_queue<char, vector<char>, greater<char>>;
using primax_string = priority_queue<string>;
using primin_string = priority_queue<string, vector<string>, greater<string>>;
using tree_int = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using tree_ll = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;
using tree_char = tree<char, null_type, less<char>, rb_tree_tag, tree_order_statistics_node_update>;
using tree_string = tree<string, null_type, less<string>, rb_tree_tag, tree_order_statistics_node_update>;

#define endl "\n"
#define YES printf("YES\n");
#define Yes printf("Yes\n");
#define NO printf("NO\n");
#define No printf("No\n");
#define rep0(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define ALL(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int INF = 1e9;
const int MININF = -1e9;
const ll LINF = 1e18;
const ll MINLINF = -1e18;
const int MOD = 1e9 + 7;
const int MODD = 998244353;
const char MARU = 'o';
const char BATU = 'x';

// 8方向（4方向なら<4）
vector<int> vx = {0, 1, 0, -1, 1, -1, 1, -1};
vector<int> vy = {1, 0, -1, 0, 1, -1, -1, 1};

template <class T>
bool chmax(T &a, const T& b) {
    if(a < b) {a = b;return true;}
    return false;
}

template <typename T>
bool chmin(T &a, const T& b) {
    if(a > b) {a = b;return true;}
    return false;
}

// 切り捨て（A/B以下の最大の整数）
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a = -a, b = -b;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

// 切り上げ（A/B以上の最小の整数）
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a = -a, b = -b;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

// l以上r以下の総和
template <typename T>
T sigma(T l, T r) {
    return (l + r) * (r - l + 1) / 2;
}

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/* binary_search set */

// Xより大きい個数・末尾からの距離（同一要素がある場合、一番右側）
template <typename T>
T number_greater_x(vector<T> A, T X) {
    return A.end() - upper_bound(A.begin(), A.end(), X);
}

// X以上の個数・末尾からの距離（同一要素がある場合、一番左側）
template <typename T>
T quantity_of_x(vector<T> A, T X) {
    return A.end() - lower_bound(A.begin(), A.end(), X);
}

// xの個数
template <typename T>
T number_of_x(vector<T> A, T X) {
    return upper_bound(A.begin(), A.end(), X) - lower_bound(A.begin(), A.end(), X);
}

// x以下の個数・先頭からの距離（同一要素がある場合、一番右側）
template <typename T>
T number_less_of_x(vector<T> A, T X) {
    return upper_bound(A.begin(), A.end(), X) - A.begin();
}

// x未満の個数・先頭からの距離（同一要素がある場合、一番左側）
template <typename T>
T number_less_than_x(vector<T> A, T X) {
    return lower_bound(A.begin(), A.end(), X) - A.begin();
}

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/* input set */

// 1D配列入力 0-index
template<typename T>
vector<T> read_vector_1D(int X, bool sort_flag = false) {
    vector<T> A(X);
    for(auto &i: A)cin >> i;
    if(sort_flag)sort(A.begin(), A.end());
    return A;
}

// 2D配列入力 0-index
template <typename T>
vector<vector<T>> read_vector_2D(int N, int M) {
    vector<vector<T>> A(N, vector<T>(M));

    for(auto &i: A) {
        for(auto &j: i) {
            cin >> j;
        }
    }
    return A;
}

// 3D配列入力 0-index
template <typename T>
vector<vector<vector<T>>> read_vector_3D(int A, int B, int C) {
    vector<vector<vector<T>>> arr(A, vector<vector<T>>(B, vector<T>(C)));

    for(auto &i: arr) {
        for(auto &j: i) {
            for (auto& k : j) {
                cin >> k;
            }
        }
    }
    return arr;
}

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////


int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N; cin>>N;
    sti st;

    for(int i=1;i<=N;i++){
        st.insert(N/i);
    }

    cout<<st.size()<<endl;
}