#include <bits/stdc++.h>
using namespace std;
int a[100001], n;
bool func(double val, int &k) {
  double x = a[k == 0];
  for (int i = (k != -1) + 1; i < n; i++) {
    if (fabs(x * val - a[i]) < 1e-6)
      x = a[i];
    else if (k != -1)
      return false;
    else
      k = i;
  }
  return true;
}
double findb(double x, double y) {
  if (fabs(x) < 0.5 || fabs(y) < 0.5)
    return 0;
  else
    return y / x;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  if (n == 1) {
    cout << "0\n";
    return 0;
  }
  double b;
  int k = -1;
  b = findb(a[0], a[1]);
  if (func(b, k) == true) {
    if (k == -1)
      cout << "0\n";
    else
      cout << "1\n";
    return 0;
  }
  if (n > 2) {
    k = 1;
    b = findb(a[0], a[2]);
    if (func(b, k) == true) {
      cout << "1\n";
      return 0;
    }
    k = 0;
    b = findb(a[1], a[2]);
    if (func(b, k) == true) {
      cout << "1\n";
      return 0;
    }
  }
  cout << "2\n";
  return 0;
}
