def combination(n, k):
	x = 1
	for i in range(0, k):
		x = x * (n-i)
	for i in range(0, k):
		x = x / (k-i)
	return x

lst = []
for i in range(0, 26):
	lst.append(int(raw_input()))
countlist = []
countlist.append(lst[3])
countlist.append(lst[4])
countlist.append(lst[7])
countlist.append(lst[11]/3)
countlist.append(lst[14]/2)
countlist.append(lst[17])
countlist.append(lst[22])
ans = 0
for i in range(0, 7):
	if lst[i] == 0:
		ans = 0
		break
	if ans == 0:
		ans = 1
	if i == 3: ans = ans * combination(lst[3], 3)
	elif i == 4: ans = ans * combination(lst[4], 2)
	else: ans = ans * lst[i]
print ans