// Arup Guha
// 6/6/2023
// Number of Divisors: Version 2

using namespace std;
#include <iostream>

int main() {

    int n, numdiv = 0;
    cin >> n;

    // Stop by square root, handle special case.
    for (int i=1; i*i<=n; i++) {
        if (n%i == 0) {
            numdiv++;
            if (n/i > i) numdiv++;
        }
    }

    // Ta da!
    cout << numdiv << endl;
    return 0;
}