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;
int memo[100005];
int a[100005];
int n;
int UNCALC = 1;
int INF = 10000000;
int dp(int pos) {
  if (pos == n - 1) return a[pos] >= a[pos - 1];
  if (memo[pos] != UNCALC) return memo[pos];
  int take = 1;
  int leave = 1;
  if (a[pos] <= a[pos + 1]) {
    take = 1 + dp(pos + 1);
  } else {
    leave = -INF + dp(pos + 1);
  }
  return memo[pos] = max(take, leave);
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i <= n + 5; i++) memo[i] = 1;
  if (n == 1) {
    cout << 1;
    return 0;
  }
  dp(0);
  int ans = 0;
  for (int i = 0; i < n; i++) ans = max(ans, memo[i]);
  cout << ans;
}
