#include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], n;
int del(int i) {
  int j, k;
  k = 0;
  for (j = 0; j < n; j++) {
    if (j != i) b[k++] = a[j];
  }
  if (n == 3) {
    if (a[0] == 0 && a[1] != 0)
      return 2;
    else
      return 1;
  } else {
    for (j = 2; j < n - 1; j++) {
      if (b[j] * b[j - 2] != b[j - 1] * b[j - 1]) return 2;
    }
    return 1;
  }
}
int check() {
  int i, j, k = 0;
  int res = 9999;
  bool flag = true;
  for (i = 2; i < n; i++) {
    if (a[i] * a[i - 2] != a[i - 1] * a[i - 1]) {
      flag = false;
      if (i == n - 1)
        res = 1;
      else
        res = min(res, del(i));
      break;
    }
  }
  if (flag) return 0;
  res = min(res, del(0));
  res = min(res, del(1));
  return res;
}
int main() {
  int i, j, k, cnt0;
  while (scanf("%d", &n) != EOF) {
    cnt0 = 0;
    for (i = 0; i < n; i++) {
      scanf("%d", &a[i]);
      if (a[i] == 0) cnt0++;
    }
    if (n == 1) {
      puts("0");
      continue;
    }
    if (n == 2) {
      if (a[0] == 0 && a[1] != 0)
        puts("1");
      else
        puts("0");
      continue;
    }
    if (cnt0 == n) {
      puts("0");
      continue;
    }
    if (cnt0 > 1) {
      if (a[0] != 0) {
        if (cnt0 == n - 2)
          puts("1");
        else if (cnt0 == n - 1)
          puts("0");
        else
          puts("2");
      } else {
        if (cnt0 == n - 1)
          puts("1");
        else
          puts("2");
      }
      continue;
    }
    int r1 = check();
    cout << r1 << endl;
  }
  return 0;
}
