#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
long long a[maxn], pre[maxn];
int main(){
int n;
cin >> n;
for(int i = 1; i <= n; i++){
cin >> a[i];
pre[i] = pre[i - 1] + a[i];
}
int l = 1, r = 1;
long long mx = -0xff;
long long mxn = 0;
for(l = 1, r = 1; r <= n; r++){
if(r - (l - 1) > mxn && (pre[r] - pre[l - 1]) % 7 == 0){
mxn = r - (l - 1);
}
if(r == n){
r = ++l;
}
}
cout << mxn;
return 0;
}