#include <bits/stdc++.h>
using namespace std;
void ans(int x) {
  printf("%d\n", x);
  exit(0);
}
bool geom(vector<int> a) {
  if (((int)(a).size()) == 1) return true;
  if (a[0] == 0) {
    for (int i = 0; i < ((int)(a).size()); ++i)
      if (a[i] != 0) return false;
    return true;
  }
  bool mul;
  if (a[1] == 0 || abs(a[1]) >= abs(a[0]))
    mul = true;
  else
    mul = false;
  long long b, q = a[0];
  if (mul)
    b = a[1] / a[0];
  else
    b = a[0] / a[1];
  for (int i = 1; i < ((int)(a).size()); ++i) {
    if (mul)
      q *= b;
    else
      q /= b;
    if (a[i] != q) return false;
  }
  return true;
}
int n;
int a[100005];
int calc(int b, int s) {
  int res = 0;
  int t = a[s];
  for (int i = s + 1; i < n; ++i)
    if (t * b != a[i])
      ++res;
    else
      t *= b;
  return res;
}
void solve_small() {
  vector<int> s;
  for (int i = 0; i < n; ++i) s.push_back(a[i]);
  if (geom(s)) ans(0);
  for (int i = 0; i < n; ++i) {
    vector<int> s;
    for (int j = 0; j < n; ++j)
      if (i != j) s.push_back(a[j]);
    if (geom(s)) ans(1);
  }
}
void solve() {
  if (calc(0, 0) == 0) ans(0);
  if (calc(1, 0) == 0) ans(0);
  if (calc(-1, 0) == 0) ans(0);
  if (calc(0, 0) == 1) ans(1);
  if (calc(1, 0) == 1) ans(1);
  if (calc(-1, 0) == 1) ans(1);
  if (calc(0, 1) == 0) ans(1);
  if (calc(1, 1) == 0) ans(1);
  if (calc(-1, 1) == 0) ans(1);
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) scanf("%d", &a[i]);
  if (n <= 16) {
    solve_small();
    ans(2);
  }
  solve();
  ans(2);
  return 0;
}
