Mancala (模拟)

Mancala is a game famous in the Middle East. It is played on a board that consists of 14 holes.

Initially, each hole has ai

stones. When a player makes a move, he chooses a hole which contains a positive number of stones. He takes all the stones inside it and then redistributes these stones one by one in the next holes in a counter-clockwise direction.

Note that the counter-clockwise order means if the player takes the stones from hole i

, he will put one stone in the (i+1)-th hole, then in the (i+2)-th, etc. If he puts a stone in the 14

-th hole, the next one will be put in the first hole.

After the move, the player collects all the stones from holes that contain even number of stones. The number of stones collected by player is the score, according to Resli.

Resli is a famous Mancala player. He wants to know the maximum score he can obtain after one move.

Input

The only line contains 14 integers a1,a2,…,a14

( 0≤ai≤109

) — the number of stones in each hole.

It is guaranteed that for any i

( 1≤i≤14) ai

is either zero or odd, and there is at least one stone in the board.

Output

Output one integer, the maximum possible score after one move.

Examples

Input

0 1 1 0 0 0 0 0 0 7 0 0 0 0

Output

4

Input

5 1 1 1 1 0 0 0 0 0 0 0 0 0

Output

8

Note

In the first test case the board after the move from the hole with 7

stones will look like 1 2 2 0 0 0 0 0 0 0 1 1 1 1. Then the player collects the even numbers and ends up with a score equal to 4.

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long LL;
const int N = 20;
LL arr[N],mp[N];
int main(){
	for(int i=1;i<=14;i++)
	   scanf("%lld",&arr[i]);
	LL maxt=0; 
	for(int i=1;i<=14;i++){
		LL ans=0;
		if(arr[i]){
			memcpy(mp,arr,sizeof(arr));
			LL k=arr[i]/14;
			LL r=arr[i]%14;
			mp[i]=0;
			for(int j=1;j<=14;j++){
				mp[j]+=k;
				if(r){
				  int s=(i+j)%14;
				  if(s==0) s=14;
				  mp[s]++;
				  r--;	
				}
			}
			for(int j=1;j<=14;j++)
			   if(mp[j]%2==0) ans+=mp[j];
			maxt=max(maxt,ans);
		}
	}
	printf("%lld\n",maxt);
	return 0;
}