import sys

def find_max(arr, low, high):
    if low == high:
        return arr[low]
    
    mid = (low + high) // 2
    
    left_max = find_max(arr, low, mid)
    right_max = find_max(arr, mid + 1, high)
    
    return left_max if left_max > right_max else right_max

def solve():
    nums = [15, 42, 7, 29, 88, 54]
    #nums = [15, -10, 7, 29, 88, 54]
    #nums = [-1]
    
    if not nums:
        print("Array is empty.")
        return

    result = find_max(nums, 0, len(nums) - 1)
    print(f"Array: {nums}")
    print(f"Maximum element = {result}")

if __name__ == "__main__":
    solve()