{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"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:\r\u003cbr\u003e\r\u003cbr\u003e1) 1+1+1+1+1+1+1\r\u003cbr\u003e2) 1+1+1+1+1+2\r\u003cbr\u003e3) 1+1+1+2+2\r\u003cbr\u003e4) 1+1+1+4\r\u003cbr\u003e5) 1+2+2+2\r\u003cbr\u003e6) 1+2+4\r\u003cbr\u003e\r\u003cbr\u003eHelp FJ count all possible representations for a given integer N (1 \u0026lt;\u003d N \u0026lt;\u003d 1,000,000).\r\u003cbr\u003e"}},{"title":"Input","value":{"format":"HTML","content":"A single line with a single integer, N."}},{"title":"Output","value":{"format":"HTML","content":"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)."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e7\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e6\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}