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: Runtime Error)

k = input()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'

a, b, c = k.split(' ')

if a == b == c:
  print(len(a))
elif a == b:
  for i in reversed(range(0, len(c))):
    if a.endswith(c[i:]) or a.startswith(c[:i]):
      print(len(a) + len(c) - i)
      break
elif a == c:
  for i in reversed(range(0, len(c))):
    if a.endswith(b[i:]) or a.startswith(b[:i]):
      print(len(a) + len(c) - i)
      break
elif b == c:
  for i in reversed(range(0, len(c))):
    if b.endswith(a[i:]) or b.startswith(c[:i]):
      print(len(b) + len(a) - i)
      break