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
#code

def KMPS(pat, txt,lps): 
    M = len(pat) 
    N = len(txt)
    j = 0;i=0
    while i < N: 
        if pat[j] == txt[i]: 
            i += 1
            j += 1
        if j == M: 
            return 1
            j = lps[j-1] 
        elif i < N and pat[j] != txt[i]:
            if j != 0: 
                j = lps[j-1] 
            else: 
                i += 1
    return 0
s=input()
s=s.lower()
n=len(s)
pi=[0]*n
m=0;i=1
while i<n:
    if s[i]==s[m]:
        m+=1
        pi[i]=m
        i+=1
    else:
        if m:
            m=pi[m-1]
        else:
            pi[i]=0
            i+=1

cr=pi[n-1]
if cr==0:
    print("Just a legend")
else:
    an=s[n-cr:]
    ix=1
    for i in range(n):
        if pi[i]:
            ix=i;break
    if pi.count(len(an))<2:
        an=an[ix:]
        t=len(an)
        if an:
            if an==s[:t] and an==s[n-t:]:
                pi=[0]*t
                m=0;i=1
                while i<t:
                    if an[i]==an[m]:
                        m+=1
                        pi[i]=m
                        i+=1
                    else:
                        if m:
                            m=pi[m-1]
                        else:
                            pi[i]=0
                            i+=1
                if not KMPS(an,s[1:n-1],pi):
                    an=''
            else:
                an=''
    if an:
        print(an)
    else:
        print("Just a legend")
        
        