#include<bits/stdc++.h>
using namespace std;
int n = 0;
int* brr;
int xrr[7];
void hanshu(int book)
{
	int a = -1, b = -1;
	for (int i = n - 1; i >= 0; i--)
	{
		if (brr[i] == book)
		{
			a = i;
			break;
		}
	}
	for (int i = 0; i < a; i++)
	{
		if (brr[i] == book)
		{
			b = i;
			break;
		}
	}
	if (a == -1 || b == -1)
	{
		xrr[book] = 0;
		return;
	}
	xrr[book] = a - b;
}
int main()
{
	memset(xrr, 0, sizeof(xrr));
	scanf("%d", &n);
	int* arr = (int*)calloc(n, sizeof(int));
	brr = (int*)calloc(n, sizeof(int));
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);
		if (i == 0)
		{
			brr[i] = arr[i];
		}
		else
		{
			brr[i] = arr[i] + brr[i - 1];
		}
	}
	for (int i = 0; i < n; i++)
	{
		brr[i] %= 7;
	}
	for (int i = n - 1; i >= 0; i--)
	{
		if (brr[i] == 0)
		{
			xrr[0] = i+1;
			break;
		}
	}
	for (int i = 1; i < 7; i++)
	{
		hanshu(i);
	}
	sort(xrr, xrr + 7);
	cout << xrr[6];
}