CF580A Kefa and First Steps

Kefa decided to make some money doing business on the Internet for exactly $ n $ days. He knows that on the $ i $ -th day ( $ 1

The first line contains integer $ n $ ( $ 1

Print a single integer — the length of the maximum non-decreasing subsegment of sequence $ a $ .

In the first test the maximum non-decreasing subsegment is the numbers from the third to the fifth one. In the second test the maximum non-decreasing subsegment is the numbers from the first to the third one.