const MOD: usize = 1e9 as usize + 7; fn power(base: usize, times: usize) -> usize { if times == 0 { return 1usize; } if times == 1 { return base; } let temp = power(base, times/2); temp * temp % MOD * power(base, times%2) % MOD } fn main() { let mut n = String::new(); std::io::stdin().read_line(&mut n).ok(); let n: usize = n.trim().parse().unwrap(); let div2 = power(2, MOD-2); let limit = format!("{:b}", n).len(); let mut result = 0usize; for i in 0..limit { let cnt = if i + 1 == limit { (n+1) - (1usize << i) } else { (n & ((n >> (i+1)) << (i+1))) / 2 + if ((n >> i) & 1) == 1 { 1 + n % (1 << i) } else { 0 } }; let cnt2 = cnt / (1usize << i); // let cnt22 = cnt / (1usize << i) + if cnt % (1usize << i) > 0 { 1 } else { 0 }; let span = (1usize << i) % MOD * ((1usize << (i+1)) % MOD) % MOD; result += if cnt2 == 0 { 0 } else { (cnt2 % MOD) * ((cnt2-1) % MOD) % MOD * div2 % MOD * span % MOD }; // result += (cnt22 % MOD) * ((cnt22-1) % MOD) % MOD * div2 % MOD * span % MOD; // eprintln!("{} {} {} {} {}", i, cnt, cnt2, span, result); result += cnt2 * (1usize << i) % MOD * ((1usize << i) * 3 - 1) % MOD * div2 % MOD; // result += cnt2 * (1usize << i) % MOD * (1usize << i) % MOD; // result += cnt2 % MOD * (1usize << i) % MOD * (((1usize << i)-1) % MOD) % MOD * div2 % MOD; // eprintln!("{} {}", i, result); let rest = cnt - cnt2 * (1usize << i); if rest > 0 { let rest_start = (1usize << i) + cnt2 * (1usize << (i+1)); result += rest % MOD * ((rest_start * 2 % MOD + rest - 1) % MOD) % MOD * div2 % MOD; } result %= MOD; // eprintln!("{} {}", i, result); } // eprintln!("==================="); // let mut tempsum = 0usize; // for i in 0..limit { // tempsum += (1..=n).filter(|&j| ((j >> i) & 1) == 1).sum::(); // eprintln!("pass: {} {} {} {}", i, (1..=n).filter(|&j| ((j >> i) & 1) == 1).count(), (1..=n).filter(|&j| ((j >> i) & 1) == 1).sum::(), tempsum); // } println!("{}", result); }