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)

import itertools

a=input()
b=input()
c=input()

def eq(s,t,i):

    for _s,_t in zip(s[-1*i:],t[:i]):

        if _s==_t:
            pass
        elif _s=='?' or _t=='?':
            pass
        else:
            return False
    return True

def join(s,t):
    retval=0
    for i in range(min(len(s),len(t))+1):
        if eq(s,t,i):
            retval=i

    prob1=s[:len(s)-retval]+t
    prob2=s+t[retval:]
    if prob1.count('?')<prob2.count('?'):
        return prob1
    else:
        return prob2

retval=10**10
for strs in itertools.permutations([a,b,c]):
    p=strs[0]
    q=strs[1]
    r=strs[2]
    pqr=join(join(p,q),r)
    pqr2=join(p,join(q,r))
    if(len(pqr)<retval):
        retval=len(pqr)
    if(len(pqr2)<retval):
        retval=len(pqr2)
print(retval)