#include "bits/stdc++.h"
#include "atcoder/all"
using namespace std;
using namespace atcoder;
using mint = modint1000000007;
const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
long long calc(int x, int y) {
	long long ret = 1;
	bool b = true;
	while ((x > 0) || (y > 0)) {
		int _x = x % 2;
		int _y = y % 2;
		if ((1 == _x) && (1 == _y)) {
			ret *= 2;
			b = false;
		}
		else if ((1 == _x) && (0 == _y)) {
			ret *= 0;
			b = false;
		}
		x /= 2;
		y /= 2;
	}
	if (b) { ret *= 2; }
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N;
	cin >> N;
	long long ans = 0;
	for (long long i = 1; i <= sqrt(N); i++) {
		if (0 != N % i) { continue; }
		int x = i;
		int y = N / i;
		ans += calc(x, y);
		if (x != y) {
			ans += calc(y, x);
		}
	}
	ans /= 2;
	cout << ans << endl;
	return 0;
}