#include<iostream>
#include<cmath>
using namespace std;
int main()
{
	int n;
	cin>>n;
	int n0[n+2];
	int n1[n+2];
	double beishu[n+2];
	int cnt[n+2]={0};
	n0[1]=1;
	n0[2]=1;
	for(int i=1;i<=n;i++){
		cin>>n1[i];
	}
	//cout<<n0[1]<<"\t";
	//cout<<n0[2]<<"\t";
	for(int i=3;i<=n;i++){
		n0[i]=n0[i-1]+n0[i-2];
		//cout<<n0[i]<<"\t";
	}
	//cout<<endl;
	
	for(int i=1;i<=n;i++){
		beishu[i]=n1[i]*1.0/n0[i];
		//cout<<beishu[i]<<"\t";
	}
	//cout<<endl;
	for(int i=1;i<=n;i++){
		for(int j=n;j>=1;j--)
			if(fabs(beishu[j]-beishu[i])<=0.0005){
				cnt[i]++;
			}
	}
	int max=0;
	for(int i=1;i<=n;i++){
		if(cnt[i]>max)
		max=cnt[i]; 
	}
	n=n-max;
	cout<<n;
	return 0;
}