input: Write a python function to calculate the total number of unset bits in the range from 1 to n.
  assert total_Unset_Bits(2) == 1
  assert total_Unset_Bits(5) == 4
  assert total_Unset_Bits(14) == 17
output: def total_Unset_Bits(n):
      def count_unset_bits(x):
          unset_bits = 0
          while x > 0:
              if x & 1 == 0:
                  unset_bits += 1
              x >>= 1
          return unset_bits
      
      total_unset_bits = 0
      for i in range(1, n + 1):
          total_unset_bits += count_unset_bits(i)
      return total_unset_bits