Задача 39248. Error

Given a sequence of N natural numbers. It is known that the sum of all numbers in the sequence does not exceed 10⁹. All its continuous subsequences are considered, in which the number of even numbers is a multiple of K = 8. Find the largest sum of such a subsequence. 

Input
Given two input files (file A and file B), each containing in the first line, the number of numbers N (1 <= N <= 1,000,000). Each of the following N lines contains one natural number not exceeding 1000.

An example of the organization of source data in the input file (for К=4):
6
9
16
4
12
10
18

In this set, you can select the sequences 9+16+4+12+10 (sum 51) and 4+12+10+18 (sum 44). 
Response(for K = 4): 51. 

Warning: do not use brute-force algorithm to process file B, which calculates the sum of all possible options, as the program written in such an algorithm will run too long.