input: Write a python function that calculates the total number of unset bits between 1 and n.
  assert count_Unset_Bits(2) == 1
  assert count_Unset_Bits(5) == 4
  assert count_Unset_Bits(14) == 17
output: 
  def count_Unset_Bits(n):
      total_unset_bits = 0
      for num in range(1, n + 1):
          unset_bits = len(bin(num)) - 2 - bin(num).count('1')
          total_unset_bits += unset_bits
      return total_unset_bits
  