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_pre(texte, longueur): 
    M = [0 for i in range(longueur)]
    index_deb = 0
    M[0] = 0
    i = 1
    while (i < longueur):
        if (texte[i] == texte[index_deb]):
            index_deb += 1
            M[i] = index_deb
            i += 1
        else:
            if (index_deb != 0):
                index_deb = M[index_deb - 1]
            else:
                M[i] = 0
                i += 1
    return M
    
def KMP_algo(texte, longueur):
    M = KMP_pre(texte, longueur)
    #pas de suffixe qui soit prefixe
    if (M[longueur - 1] == 0):
        return -1
    #on cherche le motif qui soit ni prefixe ni suffixe
    for i in range(0,longueur - 1):
        if (M[i] == M[longueur - 1]): 
            return texte[0:M[i]]
    
    if (M[M[longueur - 1] - 1] == 0):
        return -1
    else:
        return texte[0:M[M[longueur - 1] - 1]]

def main(texte):
    res = KMP_algo(texte, len(texte))
    if res == -1:
        print('Just a legend')
    else:
        print(res)

main(input())
	     		 		 	 	  	   		  	 		