output_description: Print the maximum possible value of K. If no rectangle can be formed, print
  `0`.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      a_I a_O a_T a_J a_L a_S a_Z
attempt: ## coding: UTF-8
  # 最後の方のテストケースでREになってしまう。時間切れ。
  # from decimal import *
  # from itertools import permutations, combinations,combinations_with_replacement,product
  
  # N = int(input())
  
  s = input().split()
  p = [int(w) for w in s]
  
  # print(p)
  
  I = p[0]
  O = p[1]
  # T = p[2] #使わない
  J = p[3]
  L = p[4]
  # S = p[5] #使わない
  # Z = p[6] #使わない
  
  answer = 0
  
  answer += O  # O型は最初に全部使います。
  
  
  if I % 2 == J % 2 and I % 2 == L % 2:
      # [odd,odd,odd] or [even,even,even]
      # [0,0,0],[0,0,even]
      answer += I + J + L
  elif (I + J + L) % 2 == 1:
      # [even,even,odd]
      # [0,0,odd]
      answer += I + J + L - 1
  else:
      # [even,odd,odd]
      # if(min(I,J,L) % 2 == 0):
      # answer += I+J+L - 2
      # else:
      # answer += I+J+L - 1
      answer += I + J + L - 1
  
  print(answer)
  
problem_description: Statement
  
  A _tetromino_ is a figure formed by joining four squares edge to edge. We will
  refer to the following seven kinds of tetromino as I-, O-, T-, J-, L-, S- and
  Z-tetrominos, respectively:
  
  ![a60bcb8e9e8f22e3af51049eda063392.png](https://atcoder.jp/img/agc008/a60bcb8e9e8f22e3af51049eda063392.png)
  
  Snuke has many tetrominos. The number of I-, O-, T-, J-, L-, S- and
  Z-tetrominos in his possession are a_I, a_O, a_T, a_J, a_L, a_S and a_Z,
  respectively. Snuke will join K of his tetrominos to form a rectangle that is
  two squares tall and 2K squares wide. Here, the following rules must be
  followed:
  
    * When placing each tetromino, rotation is allowed, but reflection is not.
    * Each square in the rectangle must be covered by exactly one tetromino.
    * No part of each tetromino may be outside the rectangle.
  
  Snuke wants to form as large a rectangle as possible. Find the maximum
  possible value of K.
samples: [{"input": "2 1 1 0 0 0 0", "output": "3\n    \n\nOne possible way to form the largest rectangle is shown in the following\nfigure:\n\n![45515ed2a1dd5e41c5e4ca1f39323d8e.png](https://atcoder.jp/img/agc008/45515ed2a1dd5e41c5e4ca1f39323d8e.png)\n\n* * *"}, {"input": "0 0 10 0 0 0 0", "output": "0\n    \n\nNo rectangle can be formed."}]