#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline bool isSquare(T x) {
  T y = sqrt(x + 0.5);
  return (y * y) == x;
}
template <class T1, class T2>
inline T1 gcd(T1 a, T2 b) {
  return b ? gcd(b, a % b) : a;
}
template <class T1, class T2>
inline T1 eqMin(T1 &x, const T2 &y) {
  if (T1(y) < x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 eqMax(T1 &x, const T2 &y) {
  if (T1(y) > x) return x = y;
  return x;
}
template <class T1, class T2>
inline T1 min(const T1 &x, const T2 &y) {
  return x < (T1)y ? x : (T1)y;
}
template <class T1, class T2>
inline T1 max(T1 &x, const T2 &y) {
  return x > (T1)y ? x : (T1)y;
}
template <typename T>
inline T getint() {
  T x = 0, p = 1;
  char ch;
  do {
    ch = getchar();
  } while (ch <= ' ');
  if (ch == '-') p = -1, ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x * p;
}
struct _flag_t {
  string val;
} const _1d{", "}, _2d{"\n  "};
_flag_t _flag = _1d;
ostream &operator<<(ostream &os, _flag_t flag) {
  _flag = flag;
  return os;
}
template <class It>
ostream &_out(ostream &os, It f, It l) {
  if (f == l) return os << "{}";
  _flag_t cur_flag = _flag;
  os << _1d << "{ " << *f;
  for (; ++f != l; os << cur_flag.val << *f)
    ;
  return os << " }";
}
template <class C>
auto operator<<(ostream &os, C const &cont)
    -> decltype(begin(cont), end(cont), cont.size(), declval<ostream &>()) {
  return _out(os, begin(cont), end(cont));
}
ostream &operator<<(ostream &os, string const &s) { return os << s.data(); }
template <class X, class Y>
ostream &operator<<(ostream &os, pair<X, Y> const &p) {
  return os << "[" << p.first << ", " << p.second << "]";
}
const double PI = acos(-1);
const double EPS = 1e-8;
const int INF = (int)2e9;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)103;
int n, sum, ans;
set<int> s;
int a[MAXN];
bool dp[MAXN][MAXN][MAXN * MAXN], rev[MAXN][MAXN][MAXN * MAXN];
int cnt[MAXN * MAXN];
void input() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    cnt[a[i]]++;
    s.insert(a[i]);
    sum += a[i];
  }
}
void solveDp() {
  sort(a + 1, a + n + 1);
  dp[0][0][0] = true;
  for (int i = 0; i < n; i++) {
    int next = i + 1;
    for (int k = 0; k < n; k++) {
      for (int m = 0; m <= sum; m++) {
        if (!dp[i][k][m]) {
          continue;
        }
        dp[next][k + 1][m + a[next]] |= dp[i][k][m];
        dp[next][k][m] |= dp[i][k][m];
      }
    }
  }
}
void solveRev() {
  reverse(a + 1, a + n + 1);
  rev[0][0][0] = true;
  for (int i = 0; i < n; i++) {
    int next = i + 1;
    for (int k = 0; k < n; k++) {
      for (int m = 0; m <= sum; m++) {
        if (!rev[i][k][m]) {
          continue;
        }
        rev[next][k + 1][m + a[next]] |= rev[i][k][m];
        rev[next][k][m] |= rev[i][k][m];
      }
    }
  }
  reverse(a + 1, a + n + 1);
}
void solve() {
  for (int i = 1; i <= n; i++) {
    int r = i, l = i - 1;
    while (r <= n && a[r] == a[i]) {
      r++;
    }
    r = n - r + 1;
    int k = 0;
    int iter = i;
    while (a[iter] == a[i]) {
      iter--;
      k++;
    }
    int m = a[i] * k;
    bool can = false;
    for (int k1 = 0; k1 <= k; k1++) {
      for (int m1 = 0; m1 <= m; m1++) {
        if (dp[l][k1][m1] && rev[r][k - k1][m - m1]) {
          can = true;
          k1 = 100500;
          break;
        }
      }
    }
    if (!can) {
      eqMax(ans, k);
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  input();
  solveDp();
  solveRev();
  solve();
  if (s.size() == 2) {
    cout << n;
    return 0;
  }
  cout << ans;
}
