#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:640000000")
using namespace std;
const double eps = 1e-9;
const double pi = acos(-1.0);
const int maxn = (int)1e5 + 10;
int n;
vector<int> v;
int a[maxn];
int check(int start) {
  if (v[0] == 0) {
    if (v[1] == 0) {
      int res = 2;
      for (int i = start; i < n; i++)
        if (a[i] == 0) {
          res++;
        }
      return res;
    } else {
      return 0;
    }
  } else {
    if (v[1] == 0) {
      int res = 2;
      for (int i = start; i < n; i++)
        if (a[i] == 0) {
          res++;
        }
      return res;
    } else {
      int y = v[0];
      int x = v[1];
      for (int i = start; i < n; i++) {
        if (v.back() * x == a[i] * y) {
          v.push_back(a[i]);
        }
      }
      return (int)(v).size();
    }
  }
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
  if (n == 1) {
    cout << 0 << endl;
    return 0;
  }
  if (n == 2) {
    if (a[0] != 0 || a[1] == 0) {
      cout << 0 << endl;
    } else {
      cout << 1 << endl;
    }
    return 0;
  }
  v.push_back(a[0]);
  v.push_back(a[1]);
  int r = check(2);
  if (r == n) {
    cout << 0 << endl;
    return 0;
  }
  if (r == n - 1) {
    cout << 1 << endl;
    return 0;
  }
  v.clear();
  v.push_back(a[0]);
  v.push_back(a[2]);
  r = check(3);
  if (r == n - 1) {
    cout << 1 << endl;
    return 0;
  }
  v.clear();
  v.push_back(a[1]);
  v.push_back(a[2]);
  r = check(3);
  if (r == n - 1) {
    cout << 1 << endl;
    return 0;
  }
  cout << 2 << endl;
  return 0;
}
