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>
const double eps = 1e-8;
const int oo = 0x3f3f3f3f;
using namespace std;
int n;
int a[111111];
bool read() {
  if (!(cin >> n)) return false;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  return true;
}
void process() {
  int maxlen = 1;
  int r = 1;
  for (int i = 1; i < n; i++) {
    if (a[i] >= a[i - 1]) {
      r++;
    } else {
      r = 1;
    }
    maxlen = max(maxlen, r);
  }
  cout << maxlen << endl;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t = -1;
  while (t-- && read()) {
    process();
  }
  return 0;
}
