def area_polygon(s,l):
  from math import tan, pi
  
  area = s * (l ** 2) / (4 * tan(pi / s))
  return area
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums