#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;

typedef long long LL;

inline int read()
{
	char c=getchar();int num=0,f=1;
	for(;!isdigit(c);c=getchar())
		f=c=='-'?-1:f;
	for(;isdigit(c);c=getchar())
		num=num*10+c-'0';
	return num*f;
}

int n;
int a[25],b[25],cnt;
int bit[15];

inline bool check()
{
	for(int i=1;i<=10;++i)
	{
		bit[i]=0;
		for(int j=1;j<=cnt;++j)
		{
			bit[i]+=b[j]%10;
			b[j]/=10;
			if(bit[i]>=10)
				return 0;
		}
	}
	return 1;
}

int main()
{
	freopen("cowescape.in","r",stdin);
	freopen("cowescape.out","w",stdout);
	n=read();
	for(int i=1;i<=n;++i)
		a[i]=read();
	const int lim=1<<n;
	int ans=0;
	for(int i=1;i<lim;++i)
	{
		cnt=0;
		for(int j=1,c=1;j<=i;j<<=1,++c)
			if(i&j)
				b[++cnt]=a[c];
		if(cnt<=ans)
			continue;
		if(check())
			ans=cnt;
	}
	cout<<ans;
	return 0;
}