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

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int n; cin >> n;

    set<tuple<int, int>> s;
    for (int i = 1; i <= n / i; ++i) {
        if (n % i != 0) {
            continue;
        }

        auto p = i, q = n / i;

        if ((p & q) == p || (p & q) == q) {
            for (int j = p; 0 <= j; j = (j - 1) & p) {
                int a = j | (p ^ q);
                int b = a ^ ((p & q) == p ? p : q);

                if (a > b) {
                    swap(a, b);
                }

                s.insert({ a, b });

                if (j == 0) {
                    break;
                }
            }
        }
    }

    cout << size(s) << endl;
}