def sum_series(n):
  
  if n < 1:
    return 0
  else:
    return n + sum_series(n - 2)
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums