Tất cả các số của mảng có thể được làm bằng nhau không

def can_be_equal(arr):
    # Optimized: Process in-place and return early
    if not arr: return True
    
    def get_base(n):
        while n % 2 == 0: n //= 2
        while n % 3 == 0: n //= 3
        return n
        
    target_base = get_base(arr[0])
    for i in range(1, len(arr)):
        if get_base(arr[i]) != target_base:
            return False
    return True

def can_be_equal(arr):
    # Try to reduce every number to its base factor by dividing by 2 and 3
    # If all reduced numbers are same, then they can be made equal
    if not arr: return True
    
    bases = []
    for num in arr:
        while num % 2 == 0:
            num //= 2
        while num % 3 == 0:
            num //= 3
        bases.append(num)
    
    # Check if all base factors are the same
    for i in range(1, len(bases)):
        if bases[i] != bases[0]:
            return False
    return True