5803: Fox and Perfect Sets
内存限制：256 MB
时间限制：2 S
标准输入输出
题目类型：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputFox Ciel studies number theory.
She thinks a non-empty set S contains non-negative integers is perfect if and only if for any
(a can be equal to b), 
. Where operation xor means exclusive or operation (http://en.wikipedia.org/wiki/Exclusive_or).
Please calculate the number of perfect sets consisting of integers not greater than k. The answer can be very large, so print it modulo 1000000007 (109+7).
She thinks a non-empty set S contains non-negative integers is perfect if and only if for any
(a can be equal to b), . Where operation xor means exclusive or operation (http://en.wikipedia.org/wiki/Exclusive_or).Please calculate the number of perfect sets consisting of integers not greater than k. The answer can be very large, so print it modulo 1000000007 (109+7).
Input
The first line contains an integer k (0≤k≤109).Output
Print a single integer − the number of required sets modulo 1000000007 (109+7).Examples
Input
1
Output
2
Input
2
Output
3
Input
3
Output
5
Input
4
Output
6
Note
In example 1, there are 2 such sets: {0} and {0, 1}. Note that {1} is not a perfect set since 1 xor 1 = 0 and {1} doesn't contain zero.In example 4, there are 6 such sets: {0}, {0, 1}, {0, 2}, {0, 3}, {0, 4} and {0, 1, 2, 3}.
输入样例 复制
输出样例 复制