#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
const int MAXN = 100 + 10;
int n, a[MAXN], fr[MAXN];
int dp[MAXN * MAXN][MAXN];
int binom[MAXN][MAXN];
void plant() {
  for (int i = 0; i < MAXN; i++) {
    binom[i][0] = binom[i][i] = 1;
    for (int j = 1; j < i; j++) {
      binom[i][j] = fix(binom[i - 1][j] + binom[i - 1][j - 1]);
    }
  }
}
void solve() {
  plant();
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    ++fr[a[i]];
  }
  dp[0][0] = 1;
  for (int i = 0; i < n; i++) {
    for (int s = MAXN * MAXN - 1; s >= a[i]; --s) {
      for (int k = MAXN - 1; k > 0; --k) {
        add(dp[s][k], dp[s - a[i]][k - 1]);
      }
    }
  }
  int ans = 0;
  for (int x = 1; x < MAXN; x++) {
    for (int f = 1; f <= fr[x]; f++) {
      int ways = dp[x * f][f];
      add(ways, -binom[fr[x]][f]);
      if (ways == 0) {
        ans = max(ans, f);
        int cnt = 0;
        for (int i = 0; i < MAXN; i++) {
          if (i == x) {
            if (f < fr[x]) {
              ++cnt;
            }
          } else if (fr[i]) {
            ++cnt;
          }
        }
        if (cnt <= 1) {
          ans = n;
        }
      }
    }
  }
  cout << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
