#include <cstdio>

#include <vector>

#include <cstring>

#include <string>

#include <cstdlib>

#include <iostream>

#include <map>

#include <cmath>

#include <algorithm>

using namespace std;

typedef long long LL;

typedef pair<int,int>pii;

const int N = 1e5+;

const double eps = 1e-;

int T,n,w[N],sum[N<<],p[N<<],cnt,m,ret[N];

int k,a[N],mi[N];

int main() {

    while(~scanf("%d",&n)){

        int ans=;

        mi[]=1e9+;

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

            scanf("%d",&a[i]);

            mi[i]=1e9+;

        }

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

            mi[i]=min(mi[i-],a[i]);

        }

        for(int l=n,r=n;l>=;l--){

            if(mi[l]>a[r]){

                while(a[r]<mi[l]){

                    r--;

                }

                ans=max(ans,r-l);

            }

            else {

                ans=max(ans,r-l);

            }

        }

        printf("%d\n",ans);

    }

   return ;

}