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
def KMP(st):
    i = 0
    j = 1
    arr = [0 for i in range(len(st))]
    while j < len(st):
        if s[j] == s[i]:
            arr[j] = i+1
            i += 1
        else:
            while i>0:
                i = arr[i-1]
                if s[i] == s[j]:
                    arr[j] = i+1
                    i += 1
                    break
                
        j += 1
    return arr

s = input()
arr = KMP(s)
maxi = arr[-1]
found = arr[maxi-1]
for i in arr[1:-1]:
    if i == maxi:
        found = maxi
if found == 0:
    print("Just a legend")
else:
    print(s[:found])
# pre = findPreSuff(s)
# if len(pre):
#     if pre in s[1:-1]:
#         print(pre)
#     else:
#         # print("############", pre)
#         P = findPreSuff(pre)
#         if len(P):
#             print(P)
#         else:
#             print("Just a legend")

# else:
#     print("Just a legend")