SP20654 INTSUB - Interesting Subset

You are given a set X = {1, 2, 3, 4, … , 2n-1, 2n} where n is an integer. You have to find the number of interesting subsets of this set X. A subset of set X is interesting if there are at least two integers a & b such that b is a multiple of a, i.e. remainder of b divides by a is zero and a is the smallest number in the set.

The input file contains multiple test cases. The first line of the input is an integer T(

For each test case, you have to output as the format below: Case X: Y Here X is the test case number and Y is the number of subsets. As the number Y can be very large, you need to output the number modulo 1000000007.