// LUOGU_RID: 130336369
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n;
ll a[100100];
int f(int x,int y){
	int cnt=(x!=1||y!=2);
	if(!a[x]){
		if(a[y])return 2;
		for(int i=y+1;i<=n;i++)if(a[i])cnt++;
		return min(2,cnt);
	}
	if(!a[y]){
		for(int i=y+1;i<=n;i++)if(a[i])cnt++;
		return min(2,cnt);
	}
	for(int i=y+1;i<=n;i++)if(a[y]*a[y]==a[x]*a[i])x=y,y=i;
	else cnt++;
	return min(2,cnt);
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	printf("%d\n",min(min(f(1,2),f(1,3)),f(2,3)));
	return 0;
}