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>
int arrayMax(int a[], int n) {
  int maxi = a[0], i;
  for (i = 0; i < n; i++) {
    if (a[i] > maxi) {
      maxi = a[i];
    }
  }
  return maxi;
}
int printArray(int a[], int n) {
  int i;
  for (i = 0; i < n; i++) {
    printf("%d ", a[i]);
  }
}
int main() {
  int n, i, c = 1, j, maxi;
  scanf("%d", &n);
  int a[n], b[100000], l = 0;
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  for (i = 0, j = 0; i < n - 1; i++) {
    if (a[i] <= a[i + 1]) {
      c++;
    } else {
      c = 1;
    }
    b[j] = c;
    j++;
    l++;
  }
  maxi = arrayMax(b, l);
  if (n == 1) {
    maxi = 1;
  }
  printf("%d\n", maxi);
  return 0;
}
