Bzoj 1677: [Usaco2005 jan]sumsets summation

Description

Farmer John commanded his cows to search for different sets of numbers the sum to a given number. The cows use is numbers that is an integer power of 2. Here is the possible sets of numbers that sum to 7:1) 1+1+1+1+1+1+1 2) 1+1+1+1+1+2 3) 1+1+1+2+2 4) 1+1+1+4 5) 1+2+2+2 6) 1+2+4 Help FJ count all possible representations for a given integer N (1 <= N <= 1,000,000).

Given an N (1≤n≤10^6), use some 2 of the number of powers of the sum to find. Ask how many ways

Input

An integer N.

Output

The number of methods. This number may be large, please output its last 9 digits under decimal .

Sample Input7

Sample Output6

There are six ways of doing this
1) 1+1+1+1+1+1+1
2) 1+1+1+1+1+2
3) 1+1+1+2+2
4) 1+1+1+4
5) 1+2+2+2
6) 1+2+4
HINT Source

Silver

　　

Bzoj 1677: [Usaco2005 jan]sumsets summation