{"raw_statement":[{"iden":"problem statement","content":"There are $N$ squares arranged in a row from left to right.\nThe height of the $i$\\-th square from the left is $H_i$.\nYou will land on a square of your choice, then repeat moving to the adjacent square **on the right** as long as the height of the next square is not greater than that of the current square.\nFind the maximum number of times you can move."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 10^5$\n*   $1 \\leq H_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$H_1$ $H_2$ $...$ $H_N$"},{"iden":"sample input 1","content":"5\n10 4 8 7 3"},{"iden":"sample output 1","content":"2\n\nBy landing on the third square from the left, you can move to the right twice."},{"iden":"sample input 2","content":"7\n4 4 5 6 6 5 5"},{"iden":"sample output 2","content":"3\n\nBy landing on the fourth square from the left, you can move to the right three times."},{"iden":"sample input 3","content":"4\n1 2 3 4"},{"iden":"sample output 3","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}