def sum_series(number):
 import math 
 
 total = 0
 total = math.pow((number * (number + 1)) /2, 2)
 return total
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums