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
n=input()
hm=[0]*(len(n)+1)
p=31
m=len(n)
mod=10**9+9
pow=[0]*(m+1)
pow[0]=1
for i in range(1,m):
    pow[i]=(pow[i-1]*p)%mod
hm[0]=1*(ord(n[0])-ord('a')+1)
m=len(n)
s=0
e=0
ans=[]
a=0
#print((pow[8]*24+(98815946))%mod)
#print(binary_exp(12,3))
for i in range(1,m):
    x=ord(n[i])-ord('a')+1
    hm[i]=(hm[i-1]%mod+(pow[i]*x)%mod)%mod
#print(hm)
for j in range(0,m):

    a=hm[j]
    s=m-1-j
    e=m-1
    a=(hm[j]*(pow[s]))%mod

    b=(hm[e]-hm[s-1]+mod)%mod
    #print(a,b)
    if a==b:
        ans.append(j)
def check(idx):

    id=ans[idx]

    l=1
    r=id+1

    while(l<m and r<m):

        a=(hm[id]*pow[l])%mod
        b=(hm[r]-hm[l-1]+mod)%mod
        if(a==b and r!=m-1):
            return True
        l+=1
        r+=1
    return False
lo=0
hi=len(ans)
while(lo<=hi):
    mi=(lo+hi)//2
    if(check(mi)):

        lo=mi+1
    else:
        hi=mi-1
if(lo-1==-1):
    print("Just a legend")
else:
    print(n[:ans[lo-1]+1])







