Police headquarter is monitoring signal on different frequency levels. They have got two suspiciously encoded strings *s*<sub class="lower-index">1</sub> and *s*<sub class="lower-index">2</sub> from two different frequencies as signals. They are suspecting that these two strings are from two different criminals and they are planning to do some evil task.

Now they are trying to find a common substring of minimum length between these two strings. The substring must occur only once in the first string, and also it must occur only once in the second string.

Given two strings *s*<sub class="lower-index">1</sub> and *s*<sub class="lower-index">2</sub> consist of lowercase Latin letters, find the smallest (by length) common substring *p* of both *s*<sub class="lower-index">1</sub> and *s*<sub class="lower-index">2</sub>, where *p* is a unique substring in *s*<sub class="lower-index">1</sub> and also in *s*<sub class="lower-index">2</sub>. See notes for formal definition of substring and uniqueness.
The first line of input contains *s*<sub class="lower-index">1</sub> and the second line contains *s*<sub class="lower-index">2</sub> (1 ≤ |*s*<sub class="lower-index">1</sub>|, |*s*<sub class="lower-index">2</sub>| ≤ 5000). Both strings consist of lowercase Latin letters.
print("_RANDOM_GUESS_1689182494.363521")# 1689182494.363563