input: Write a Python function to determine the quantity of numbers where both the 0th and nth bits are set.
  assert count_Num(2) == 1
  assert count_Num(3) == 2
  assert count_Num(1) == 1
output: def count_Num(n):
      count = 0
      for i in range(1, 1 << n):
          if (i & 1) and (i & (1 << (n - 1))):
              count += 1
      return count