#include <bits\stdc++.h>

using namespace std;

typedef long long ll;

struct node{

    int value;

    int index;

}a[]; 

bool cmp(node x,node y){

    if(x.value != y.value) return x.value < y.value;

    return x.index < y.index;

}

int main() {

  int n;

  cin >> n;

  for(int i = ;i < n; i++){

      cin >> a[i].value;a[i].index = i;

    }

    sort(a,a+n,cmp);

    int num = a[].index;

    int ans = ;

    for(int i = ;i < n; i++){

        ans = max(ans,a[i].index-num);

        if(a[i].index < num) num = a[i].index;

    }

    cout << ans << endl;

  return ;

}

//  writen by zhangjiuding