Problem: 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

Solution (in PYTHON3):

Solution:
from collections import  defaultdict
def zeta(s):
    """z[i] contiene la longitud del mayor
    prefijo de s que tambien arranque en i"""
    n = len(s)
    z = [0]*n
    l,r = 0,0
    for i in range(1,n):
        if(i<=r): z[i] = min(r-i+1,z[i-l])
        while(i+z[i]<n and s[z[i]]==s[i+z[i]]):
            z[i]+=1
        if(i+z[i]-1>r):
            l=i
            r = i+z[i]-1
    return z

noSol = "Just a legend"
s = input()
n = len(s)
z = zeta(s)
occ = defaultdict(int)
for i in range(1,len(z)):
    occ[z[i]]+=1
occ = [(i,occ[i]) for i in occ]
occ.sort()
sol = -1
for i in range(1,len(z)):
    if(i+z[i]==n):
        x = z[i]
        if(occ[-1][0]>x or occ[-1][1]>1):
            sol = i
            break

print(s[sol:]) if sol!=-1 else print(noSol)