#!/usr/bin/env python3
import sys


def main():
    N = int(input())
    # A, B = map(int,input().split())
    def getDivisors(n: int):
        divisors = []
        i = 1
        while i * i <= n:
            if n % i == 0:
                divisors.append([i])
                divisors[-1].append(n//i)
            i += 1
        return divisors
    ans = 0
    for a, b in getDivisors(N):
        c = 1
        for i in range(max(len(bin(a)[2:]), len(bin(b)[2:]))):
            bit = (a >> i & 1, b >> i & 1)
            if bit == (1, 1):
                c *= 2
            elif bit == (1, 0):
                break
        else:
            ans += c
    print(ans // 2)

    return

if __name__ == '__main__':
    main()