#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <set>
#include <vector>
#include <algorithm>

using namespace std;

const int N = 505;
bool poss[505][250001];
vector<int> answ, pos, pos2;
int a[N], n, sumAll = 0;
int dp[N * N];


int main()
{
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
#else
	std::ios::sync_with_stdio(false);
	cin.tie(0);
#endif
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		sumAll += a[i];
	}
	sort(a, a + n);
	//reverse(a, a + n);
		for (int i = 0; i <= 500 * 500; i++) {
			dp[i] = 1e9;
		}
		for (int i = 0; i < n; i++) {
			dp[a[i]] = min(i, dp[a[i]]);
		}
		for (int sm = 0; sm <= 500 * 500; sm++) {
			if (dp[sm] == 1e9) {
				continue;
			}
			int nextInd = dp[sm] + 1;
			dp[sm + a[nextInd]] = min(dp[sm + a[nextInd]], nextInd); // в конец
			dp[sm + a[nextInd] - a[dp[sm]]] = min(dp[sm + a[nextInd] - a[dp[sm]]], nextInd); // вместо
		}

}