#include <bits/stdc++.h>
using namespace std;
int n, a[100005];
int cal(int i, int j, int k) {
  while (j--) {
    --i;
    if (i == k) --i;
  }
  return i;
}
int check(int l, int r) {
  int tot = -1;
  if (a[l] == 0) {
    for (int i = l + 1; i <= r; ++i)
      if (a[i] != 0) {
        if (tot == -1)
          tot = i;
        else
          return -2;
      }
    return tot;
  }
  if (l + 1 <= r && a[l + 1] == 0) {
    for (int i = l + 2; i <= r; ++i)
      if (a[i] != 0) {
        if (tot == -1)
          tot = i;
        else
          return -2;
      }
    return tot;
  }
  for (int i = l + 2; i <= r; ++i)
    if (a[cal(i, 2, tot)] * a[i] != a[cal(i, 1, tot)] * a[cal(i, 1, tot)]) {
      if (tot == -1)
        tot = i;
      else
        return -2;
    }
  return tot;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  if (check(0, n - 1) == -1) {
    cout << 0 << endl;
    return 0;
  }
  bool flag = false;
  if (check(0, n - 1) != -2) flag = true;
  if (check(1, n - 1) == -1) flag = true;
  a[1] = a[0];
  if (check(1, n - 1) == -1) flag = true;
  if (flag) {
    cout << 1 << endl;
    return 0;
  }
  cout << 2 << endl;
  return 0;
}
