#include<cstdio>

#include<cstring>

#include<algorithm>

#include<cstdlib>

#include<iostream>

#include<cmath>

using namespace std;

typedef long long ll;

#define maxn 50002

struct node{

    ll num,id;

}a[maxn];

bool cmp(const node &a,const node &b){

    return a.num<b.num||(a.num==b.num&&a.id<b.id);

}

int main(){

    int n;

    cin>>n;

    for(int i=;i<n;i++) cin>>a[i].num,a[i].id=i;

    sort(a, a+n, cmp);

    ll mi=a[].id,ans=;

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

        if(a[i].id>mi) ans=max(ans,a[i].id-mi);

        else mi=a[i].id;

    }

    cout<<ans<<"\n";

    return ;

}