#include <bits/stdc++.h>
using namespace std;
template <typename T>
void maxtt(T& t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T& t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "URDL";
const long long MOD2 = (long long)998244353 * (long long)998244353;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int& x, int y, int mod = 998244353) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
long long a[135], ss[1 << 20];
bool ok[1 << 20];
int ans[1 << 20];
void fmain(int tid) {
  scanf("%d", &n);
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    scanf("%lld", a + i);
    if (a[i] == 0) {
      i--;
      n--;
    }
  }
  int all = (1 << n);
  for (int(i) = 0; (i) < (int)(all); (i)++) {
    for (int(j) = 0; (j) < (int)(n); (j)++)
      if (i & (1 << j)) ss[i] += a[j];
  }
  for (int(i) = 0; (i) < (int)(all); (i)++) {
    int cnt = __builtin_popcount(i);
    for (int j = (i - 1) & i; j && (j + j >= i); j = (j - 1) & i) {
      int t = (i) ^ j;
      long long zz = abs(ss[j] - ss[t]);
      if (zz < cnt && (zz - (cnt - 1)) % 2 == 0) {
        ok[i] = 1;
        break;
      }
    }
  }
  for (int(i) = 1; (i) <= (int)(all - 1); (i)++)
    if (ok[i]) {
      maxtt(ans[i], 1);
      int x = (all - 1) ^ i;
      for (int j = x; j; j = (j - 1) & x) {
        maxtt(ans[i ^ j], ans[j] + ans[i]);
      }
    }
  int mx = 0;
  for (int(i) = 0; (i) < (int)(all); (i)++) maxtt(mx, ans[i]);
  printf("%d\n", n - mx);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
