Kefa decided to make some money doing business on the Internet for exactly n days. He knows that on the i-th day (1 ≤ i ≤ n) he makes ai money. Kefa loves progress, that's why he wants to know the length of the maximum non-decreasing subsegment in sequence ai. Let us remind you that the subsegment of the sequence is its continuous fragment. A subsegment of numbers is called non-decreasing if all numbers in it follow in the non-decreasing order.

Help Kefa cope with this task!

Input

The first line contains integer n (1 ≤ n ≤ 105).

The second line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

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

Examples

Input

6
2 2 1 3 4 1


Output

3

Input

3
2 2 9


Output

3

Note

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.
#include <bits/stdc++.h>
using namespace std;
long long i, n, A[100005], j, hasil, final, x, jumlah, a, b;
int main() {
  cin >> n;
  hasil = 0;
  final = -1;
  x = 0;
  long long cek = 0;
  for (i = 1; i <= n; i++) {
    cin >> a;
    if (i == 1) {
      x = 1;
      hasil = x;
      cek = 1;
    } else if (cek == 1 && a >= b) {
      x++;
      hasil = x;
    } else {
      x = 1;
      hasil = x;
    }
    b = a;
    if (hasil >= final) {
      final = x;
      jumlah = x;
    }
  }
  cout << jumlah << endl;
}
