#include <bits/stdc++.h>
using namespace std;
int main()
{
  int N;
  cin >> N;
  int a[N+1];
  int i,j,max = -1;
  int k;
  for(i=1;i<=N;i++)
  cin >> a[i];
  for(i=1;i<=N;i++)
  {
    if(i==1)
    {
      for(j=2;j<=N;j++)
      {
        if(a[j]<a[j-1])
        continue;
        else
        break;
      }
      k = j - i;
      if(k > max)
      max = k;
    }
    if(i == N)
    {
      for(j=N-1;j>=1;j--)
      {
        if(a[j]<a[j+1])
        continue;
        else
        break;
      }
      k = i - j;
      if(k > max)
      max = k;
    }
    if(i>1&&i<N)
    {
      int p1,p2;
      p1 = i-1;
      p2 = i+1;
      for(;p1>=1;p1--)
      {
        if(a[p1]<a[p1+1])
        continue;
        else 
        break;
      }
      for(;p2<=N;p2++)
      {
        if(a[p2]<a[p2-1])
        continue;
        else
        break;
      }
      k = p2 - p1 -1;
      if(k>max)
      max = k;
    }
  }
  cout << N-max;
  return 0;
}

In P1091 [NOIP 2004 提高组] 合唱队形