No submission language available for this problem.

Background

巴拉巴拉巴拉

Description

给你n个数，分别是a[1],a[2],...,a[n]。求一个最长的区间[x,y]，使得区间中的数(a[x],a[x+1],a[x+2],...,a[y-1],a[y])的和能被7整除。输出区间长度。若没有符合要求的区间，输出0。

Format

Input

The first line of input contains $N$ ($1 \leq N \leq 50,000$). The next $N$

lines each contain the $N$ integer IDs of the cows (all are in the range

$0 \ldots 1,000,000$).

Output

Please output the number of cows in the largest consecutive group whose IDs sum

to a multiple of 7. If no such group exists, output 0.

Samples

7
3
5
1
6
2
14
10

5

Samples Prompt

In this example, 5+1+6+2+14 = 28.

Limitation

1s, 1024KiB for each test case.