{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n Farmer John 让奶牛们找一些数加起来等于一个给出的数N。但是奶牛们只会用2的整数幂。下面是凑出7的方式\n \u003cbr\u003e \n \u003cbr\u003e1) 1+1+1+1+1+1+1 \n \u003cbr\u003e2) 1+1+1+1+1+2 \n \u003cbr\u003e3) 1+1+1+2+2 \n \u003cbr\u003e4) 1+1+1+4 \n \u003cbr\u003e5) 1+2+2+2 \n \u003cbr\u003e6) 1+2+4 \n \u003cbr\u003e \n \u003cbr\u003e帮助FJ找到 N的分配数 (1 \u0026lt;\u003d N \u0026lt;\u003d 1,000,000). \n \u003cbr\u003e\n \u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n N.\n \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\n \u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\n 排列方式总数。由于这个数可能很大,只需要保留最后9位\n \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e7\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e6\u003c/pre\u003e"}},{"title":"Hint","value":{"format":"HTML","content":"打表的会被系统自动识别判为WA"}}]}