def heap_sort(iterable):
    import heapq as hq
    
    h = []
    for value in iterable:
        hq.heappush(h, value)
    return [hq.heappop(h) for i in range(len(h))]
def similar_elements(test_tup1, test_tup2):
  
  res = tuple(set(test_tup1) & set(test_tup2))
  return (res) 