Little Petya often visits his grandmother in the countryside. The grandmother has a large vertical garden, which can be represented as a set of `n` rectangles of varying height. Due to the newest irrigation system we can create artificial rain above them.
Creating artificial rain is an expensive operation. That's why we limit ourselves to creating the artificial rain only above one section. The water will then flow to the neighbouring sections but only if each of their heights does not exceed the height of the previous watered section.
___
## Example:
Let's say there's a garden consisting of 5 rectangular sections of heights `4, 2, 3, 3, 2`.
Creating the artificial rain over the left-most section is inefficient as the water **WILL FLOW DOWN** to the section with the height of `2`, but it **WILL NOT FLOW UP** to the section with the height of `3` from there. Only 2 sections will be covered: `4, 2`.
The most optimal choice will be either of the sections with the height of `3` because the water will flow to its neighbours covering 4 sections altogether: `2, 3, 3, 2`. You can see this process in the following illustration:
___
As Petya is keen on programming, he decided to find such section that if we create artificial rain above it, the number of watered sections will be maximal.
## Output:
The maximal number of watered sections if we create artificial rain above exactly one section.
**Note: performance will be tested.**
def artificial_rain(garden):
    max_sections = 1
    curr_sections = 1
    flat_sections = 1
    previous = garden[0]
    slope = 'downhill'
    for section in garden[1:]:
        if slope == 'downhill' and section > previous:
            if curr_sections > max_sections:
                max_sections = curr_sections
            curr_sections = flat_sections + 1
            flat_sections = 1
            slope = 'uphill'       
        elif slope == 'uphill' and section < previous:
            curr_sections += 1
            flat_sections = 1
            slope = 'downhill'
        else:
            curr_sections += 1
            if section == previous:
                flat_sections += 1 
            else:
                flat_sections = 1
        previous = section
    if curr_sections > max_sections:
        max_sections = curr_sections
    return max_sections

def artificial_rain(garden):
    max_sections = 1
    curr_sections = 1
    flat_sections = 1
    previous = garden[0]
    slope = 'downhill'
    for section in garden[1:]:
        if slope == 'downhill' and section > previous:
            if curr_sections > max_sections:
                max_sections = curr_sections
            curr_sections = flat_sections + 1
            flat_sections = 1
            slope = 'uphill'       
        elif slope == 'uphill' and section < previous:
            curr_sections += 1
            flat_sections = 1
            slope = 'downhill'
        else:
            curr_sections += 1
            if section == previous:
                flat_sections += 1 
            else:
                flat_sections = 1
        previous = section
    if curr_sections > max_sections:
        max_sections = curr_sections
    return max_sections
