#include<bits/stdc++.h> using namespace std; // #define int short #define pii pair<int,int> #define fr first #define sc second #define mk make_pair int read(){int x=0,f=1;char c=getchar();while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();return x*f;} const int N=24; int n,m,ans,a[N]; short f[1<<N]; void slv(){ n=read(); for(int i=0;i<n;i++)a[i]=read(); for(int i=n-1;i>=1;i--)a[i]-=a[i-1]; for(int i=0;i<1<<n;i++){ int sum=0; for(int j=0;j<n;j++)if(i&(1<<j))sum+=a[j]; for(int j=0;j<n;j++)if(!(i&(1<<j)))f[(1<<j)|i]=max(f[i|(1<<j)],(short)(f[i]+(sum+a[j]==0))); } printf("%d",n-f[(1<<n)-1]); } signed main(){ slv(); return 0; }