Count Total Set Bits

Given a positive integer A, the task is to count the total number of set bits in the binary representation of all the numbers from 1 to A.

Return the count modulo 10⁹ + 7.

1 <= A <= 10⁹

First and only argument is an integer A.

Return an integer denoting the ( Total number of set bits in the binary representation of all the numbers from 1 to A )modulo 10⁹ + 7.

Input 1:

 A = 3

Input 2:

 A = 1

Output 1:

 4

Output 2:

 1

Explanation 1:

 DECIMAL    BINARY  SET BIT COUNT
    1          01        1
    2          10        1
    3          11        2
 1 + 1 + 2 = 4 
 Answer = 4 % 1000000007 = 4

Explanation 2:

 A = 1
  DECIMAL    BINARY  SET BIT COUNT
    1          01        1
 Answer = 1 % 1000000007 = 1