【代码超详解】Codeforces 126B. Password（KMP 的 next 数组的应用，154 ms）

传送门

一、题目描述

B. Password

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

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.

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.

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.

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.

Input

You are given the string s whose length can vary from 1 to 106 (inclusive), consisting of small Latin letters.

Output

Print the string t. If a suitable t string does not exist, then print “Just a legend” without the quotes.

Examples

Input

fixprefixsuffix

Output

fix

Input

abcdabc

Output

Just a legend

二、算法分析说明与代码编写指导

题目要求：给出一个字串，寻找一个尽量长的子串，子串既是前缀也是后缀，而且在中间亦出现过（首尾分别不能与母串的首尾重合）。
用 KMP 算法的构造 next 数组的代码打一个 next 数组。
（注意：本代码中，字符串的第一个字符的下标为 1）
设输入的字符串长为 m，则新建一个 bitset vis，然后用如下代码遍历 next 数组：