def extract_max(input):
	import re 
	 
	numbers = re.findall('\d+',input) 
	numbers = map(int,numbers) 
	return max(numbers)
def heap_queue_largest(nums,n):
  import heapq as hq
  
  largest_nums = hq.nlargest(n, nums)
  return largest_nums