Test

2000ms

262144K

Description:

Sometimes it is hard to prepare tests for programming problems. Now Bob is preparing tests to new problem about strings — input data to his problem is one string. Bob has 3 wrong solutions to this problem. The first gives the wrong answer if the input data contains the substring s₁, the second enters an infinite loop if the input data contains the substring s₂, and the third requires too much memory if the input data contains the substring s₃. Bob wants these solutions to fail single test. What is the minimal length of test, which couldn't be passed by all three Bob's solutions?

Input:

There are exactly 3 lines in the input data. The i-th line contains string s_i. All the strings are non-empty, consists of lowercase Latin letters, the length of each string doesn't exceed 10⁵.

Output:

Output one number — what is minimal length of the string, containing s₁, s₂ and s₃ as substrings.

Sample Input:

ab
bc
cd

Sample Output:

Sample Input:

abacaba
abaaba
x

Sample Output:

Informação

Provedor Codeforces

Código CF25E