#include <bits/stdc++.h>
using namespace std;
int n, i;
pair<int, int> A[100001];
int first(int x, int y) {
  int num, den, i, second = 2, j, s1 = 0, s2 = 0, mx;
  num = A[y].second;
  den = A[x].second;
  if (!den) {
    second = 1;
    for (i = y, j = y; i < n; i++)
      if (!A[i].second) second++;
  } else
    for (i = y + 1, j = y; i < n; i++)
      if (A[i].second * den == num * A[j].second) {
        second++;
        j = i;
      }
  return second;
}
int main() {
  scanf("%d", &n);
  for (i = 0; i < n; i++) {
    scanf("%d", &A[i].second);
    A[i].first = abs(A[i].second);
  }
  if (n <= 2) {
    if (n == 2 && A[0].second == 0 && A[1].second != 0)
      printf("1");
    else
      printf("0");
    return 0;
  }
  if (first(0, 1) == n)
    printf("0");
  else if (first(0, 2) == n - 1 || first(1, 2) == n - 1 || first(0, 1) == n - 1)
    printf("1");
  else
    printf("2");
  return 0;
}
