문제1244--Sumsets

### 1244: Sumsets

실행시간 제한: 2 Sec  메모리사용 제한: 200 MB
제출: 285  통과: 75
[제출] [채점기록] [묻고답하기]

#### 문제 설명

Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are 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).

#### 입력 설명

A single line with a single integer, N.

#### 출력 설명

The number of ways to represent N as the indicated sum. Due to the potential huge size of this number, print only last 9 digits (in base 10 representation).

#### 입력 예시 Copy

7

#### 출력 예시 Copy

6