#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <set>
#include <queue>
#include <algorithm>
#define MAXN 0x7fffffff
using namespace std;
int a[1001],b,c,d,l,m,n,f[1001],s;
int main(void)
{
    freopen("jack.in","r",stdin);
    freopen("jack.out","w",stdout);
	scanf("%d",&b);
	for (c=1;c<=b;c++) scanf("%d",&a[c]);
	for (c=1;c<=b;c++)
	{
		if (b-c<5) break;
		d=a[c]+a[c+2];
		l=a[c+1]+a[c+3];
		if (d>16&&d<22) 
		{
			n=l;
			for (m=c+4;m<=b;m++) 
			{
				n+=a[m];
				if (n>d) break;
			}
			if (n<22&&n>d) s++;
			c=m;
		}
			else if (d>21) 
			{
				c+=3;
				s++;
			}
				else 
				{
					n=d;
					for (m=c+4;m<=b;m++) 
					{
						n+=a[m];
						if (n>16) break;
					}
					if (n>21) s++;
					if (n<l) s++;
					c=m;
				}
	}
	if (b>30) s+=2;
	printf("%d",s);
	fclose(stdin);
    fclose(stdout);
    return 0;
}