126B.md (1665B)
1 Source: https://codeforces.com/problemset/problem/126/B 2 3 B. Password 4 5 time limit per test 6 7 2 seconds 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 stdin 16 17 output 18 19 stdout 20 21 Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them. 22 23 A little later they found a string *s*, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring *t* of the string *s*. 24 25 Prefix supposed that the substring *t* is the beginning of the string *s*; Suffix supposed that the substring *t* should be the end of the string *s*; and Obelix supposed that *t* should be located somewhere inside the string *s*, that is, *t* is neither its beginning, nor its end. 26 27 Asterix chose the substring *t* so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring *t* aloud, the temple doors opened. 28 29 You know the string *s*. Find the substring *t* or determine that such substring does not exist and all that's been written above is just a nice legend. 30 31 Input 32 33 You are given the string *s* whose length can vary from 1 to 106 (inclusive), consisting of small Latin letters. 34 35 Output 36 37 Print the string *t*. If a suitable *t* string does not exist, then print "Just a legend" without the quotes. 38 39 Examples 40 41 Input 42 43 ``` 44 fixprefixsuffix 45 ``` 46 47 Output 48 49 ``` 50 fix 51 ``` 52 53 Input 54 55 ``` 56 abcdabc 57 ``` 58 59 Output 60 61 ``` 62 Just a legend 63 ```