C++ :

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cassert>
#include <complex>
#include <ctime>

#define clr(x,a) memset(x,a,sizeof(x))
#define sz(x) (int)x.size()
#define rep(i,n) for(int i=0;i<n;i++)
#define repeat(i, a, b) for(int i=(a);i<=(b);i++)
#define all(v) (v).begin(), (v).end()
#define Unique(store) store.resize(unique(store.begin(),store.end())-store.begin())
#define X first
#define Y second



using namespace std;
const int N=123456+10;
bool cnt[N];
int cut(int n) {
    vector<int> div;
    memset(cnt,0,sizeof(cnt));
    for (int i=2; i<n; i++) {
        if (n%i==0) {
            div.push_back(n/i);
        }
    }
    for (int i=0; i<div.size(); i++) {
        int cur=div[i];
        for (int i=cur; i<=n; i+=cur) {
            cnt[i]=true;
        }
    }
    int ret=0;
    for (int i=1; i<=n; i++) {
        ret+=cnt[i];
    }
    return max(ret,1);
}
int main () {
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    //srand(time(NULL));
    int n;
    while (scanf("%d",&n)!=EOF) {
        cout<<cut(n)<<endl;
    }
    return 0;
}