CF25E.Test

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_1, the second enters an infinite loop if the input data contains the substring _s_2, and the third requires too much memory if the input data contains the substring _s_3. 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?

有时，为编程题目准备测试数据非常困难。现在，Bob 正在为一道关于字符串的新题目准备测试数据——该题目的输入数据为一个字符串。Bob 为此题准备了 3 个错误的解决方案：第一个方案在输入数据中包含子串 $s_1$ 时给出错误答案；第二个方案在输入数据中包含子串 $s_2$ 时陷入无限循环；第三个方案在输入数据中包含子串 $s_3$ 时占用过多内存。Bob 希望这些错误方案在同一个测试用例上全部失败。那么，使得所有三个错误方案均无法通过的最短测试用例长度是多少？

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 105.

输入数据中恰好有 3 行。第 $i$ 行包含字符串 $s_i$。所有字符串均非空，仅由小写拉丁字母组成，且每个字符串的长度不超过 $10^5$。

Output one number — what is minimal length of the string, containing _s_1, _s_2 and _s_3 as substrings.

输出一个数字——包含 $s_1$、$s_2$ 和 $s_3$ 作为子串的字符串的最短长度是多少。