/* -*- coding: utf-8 -*-
 *
 * 1452.cc:  No.1452 XOR×OR - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int pbs[2][2] = { { 1, 1 }, { 0, 2 } };
// ^ | -> c ab
// 0 0    1 00
// 0 1    1 11
// 1 0    0 --
// 1 1    2 01,10

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

int count(int p, int q) { // count (a,b) such that a^b=p and a|b=q
  int c = 1;
  while (p > 0 || q > 0) {
    c *= pbs[p & 1][q & 1];
    p >>= 1, q >>= 1;
  }
  return c;
}

/* main */

int main() {
  int n;
  scanf("%d", &n);

  ll sum = 0;
  for (int p = 1; p * p <= n; p++)
    if (n % p == 0) {
      int q = n / p;
      sum += count(p, q);
      if (p != q) sum += count(q, p);
    }

  printf("%lld\n", sum / 2);
  return 0;
}