/*
TASK:melody
LANG:C++
*/

#include<iostream>
#include<string>
using namespace std;

long N;
long a[1001],l[1001];
int i,j,k,br=0,o=0,br1=0,br2=0,br3=0,poz=0;

int main()
{
 
 cin>>N;

for(i=1;i<=N;i++)
cin>>a[i];

i=1;

while(i!=N)
{
           
br+=a[i];

for(j=i+1;j<=N;j++)
{
if(a[j]==a[i]) {br+=a[j]; k=j;o++;}
}

if(br>br1 && o>=1) 
{
br1=br; poz=k; br3=o+1; 
for(int t=1;t<=N;t++) {l[t]=0;} 
for(int t=1;t<=N;t++) {if(a[t]==a[poz]) l[t]=1;}
}
br=0; o=0;
i++;
}

i=poz+1;
br=0; br1=0, br2=0;



while(i<=N)
{
br+=a[i];
for(j=i+1;j<=N;j++)
{
if(a[j]==a[i] && l[j]!=1) {br+=a[j]; k=j; o++;}
}
if(br>br1 && o>=1) {br1=br; poz=k; br2=o+1;}
br=0; o=0;
i++;
}

if(br2==0 || br2==1) i=1;

while(i<=N)
{
br+=a[i];
for(j=i+1;j<=N;j++)
{
if(a[j]==a[i] && l[j]!=1) {br+=a[j]; k=j;o++;}
}
if(br>br1 && o>=1) {br1=br; poz=k; br2=o+1;}
br=0; o=0;
i++;
}

cout<<N-(br2+br3)<<"\n";
    
return 0;
}
