Problem:
Score : 500 points

Problem Statement

Snuke has a string s.
From this string, Anuke, Bnuke, and Cnuke obtained strings a, b, and c, respectively, as follows:

Choose a non-empty (contiguous) substring of s (possibly s itself). Then, replace some characters (possibly all or none) in it with ?s.

For example, if s is mississippi, we can choose the substring ssissip and replace its 1-st and 3-rd characters with ? to obtain ?s?ssip.

You are given the strings a, b, and c.
Find the minimum possible length of s.

Constraints

1 \leq |a|, |b|, |c| \leq 2000

a, b, and c consists of lowercase English letters and ?s.

Input

Input is given from Standard Input in the following format:

a
b
c

Output

Print the minimum possible length of s.

Sample Input 1

a?c
der
cod

Sample Output 1

7

For example, s could be atcoder.

Sample Input 2

atcoder
atcoder
???????

Sample Output 2

7

a, b, and c may not be distinct.

Solution in Python (3.4.3) (judge verdict: Wrong Answer)

A = input()
B = input()
C = input()

ans = len(A) + len(B) + len(C)

def merge(X, Y):
  ret = []
  for i in range(len(X)):
    s = X[:i]
    for x, y in zip(X[i:], Y):
      if x != '?' and y != '?' and x != y:
        break
      else:
        s += x if x != '?' else y
    else:
      ret.append(s + Y[len(X)-i:])
  return ret

for D in merge(A, B) + merge(B, A):
  for E in merge(D, C) + merge(C, D):
    ans = min(ans, len(E))

for D in merge(A, C) + merge(C, A):
  for E in merge(D, B) + merge(B, D):
    ans = min(ans, len(E))

for D in merge(B, C) + merge(C, B):
  for E in merge(D, A) + merge(A, D):
    ans = min(ans, len(E))

print(ans)