#include <bits/stdc++.h>
using namespace std;
long long a[100010];
int n;
int check1(long long numer, long long denom) {
  if (numer == 0 && denom == 0) {
    int count = 0;
    for (int i = 0; i < n; i++)
      if (a[i] != 0) count++;
    if (count >= 2)
      return 2;
    else
      return count;
  }
  int count = 0;
  int prev = 0;
  for (int i = 1; i < n; i++) {
    if (a[prev] * numer != a[i] * denom)
      count++;
    else
      prev = i;
    if (count > 1) return 2;
  }
  return count;
}
int check2(long long numer, long long denom) {
  if (numer == 0 && denom == 0) {
    int count = 1;
    for (int i = 1; i < n; i++)
      if (a[i] != 0) count++;
    if (count >= 2)
      return 2;
    else
      return count;
  }
  int count = 1;
  int prev = 1;
  for (int i = 2; i < n; i++) {
    if (a[prev] * numer != a[i] * denom)
      count++;
    else
      prev = i;
    if (count > 1) return 2;
  }
  return count;
}
int solve() {
  if (n == 1) return 0;
  if (n == 2) {
    if (a[0] == 0 && a[1] != 0)
      return 1;
    else
      return 0;
  }
  int c1, c2, c3;
  c1 = c2 = c3 = 2;
  if (!(a[0] == 0 && a[1] != 0)) {
    long long numer = a[1];
    long long denom = a[0];
    c1 = check1(numer, denom);
  }
  if (!(a[0] == 0 && a[2] != 0)) {
    long long numer = a[2];
    long long denom = a[0];
    c2 = check1(numer, denom);
  }
  if (!(a[1] == 0 && a[2] != 0)) {
    long long numer = a[2];
    long long denom = a[1];
    c3 = check2(numer, denom);
  }
  return min(c1, min(c2, c3));
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", &a[i]);
  printf("%d\n", solve());
}
