def METHOD_NAME(array):
    METHOD_NAME = 0
    i = 1
    while i < len(array) - 1:
        # Check if i is a peak (i.e., it's greater than its neighbors)
        is_peak = array[i - 1] < array[i] > array[i + 1]
        if not is_peak:
            # If i is not a peak, move to the next element
            i += 1
            continue
        # Search left of i to find the beginning of the peak
        left_index = i - 2
        while left_index >= 0 and array[left_index] < array[left_index + 1]:
            left_index -= 1
        # Search right of i to find the end of the peak
        right_index = i + 2
        while right_index < len(array) and array[right_index] < array[right_index - 1]:
            right_index += 1
        # Calculate the length of the current peak
        current_peak = right_index - left_index - 1
        # Update longest_peak if current_peak is longer
        if current_peak > METHOD_NAME:
            METHOD_NAME = current_peak
        # Move i to the end of the current peak
        i = right_index
    return METHOD_NAME