#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int* a = (int*)malloc(sizeof(int)*n);
	for (int i = 0; i < n; ++i)
	{
		cin >> a[i];
		if (i == 0)
		{
			a[i] = a[i] % 7;
			continue;
		}
		a[i] = (a[i] + a[i - 1]) % 7;
	}
	int las[7], fir[7];
	for (int i = 0; i < n; ++i)
	{
		las[a[i]] = i;//最后一个a[i]出现
	}
	for (int i = n - 1; i >= 0; --i)
	{
		fir[a[i]] = i;//第一个a[i]出现
	}
	int ans[7];
	int anser=0;
	for (int i = 0; i < 7; ++i)
	{
        if((las[i]>=0)&&(fir[i]>=0))
		    ans[i] = las[i] - fir[i];
        if (las[i] == fir[i])
			ans[i] = 2;
		anser = max(ans[i], anser);
	}
	cout << anser;
	return 0;
}