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_table(s):
    ret = [0]

    for i in range(0, len(s)):
        j = i
        while True:
            if j == 0:
                ret.append(0)
                break
            if s[ret[j]] == s[i]:
                ret.append(ret[j] + 1)
                break
            j = ret[j]
    
    return ret

def strictly_increasing(L):
    return all(x<y for x, y in zip(L, L[1:]))

if __name__ == "__main__":
    INPUT = input().rstrip()
    T = KMP_table(INPUT)
    longest_prefix = T[len(T) - 1]
    isSamePrefix = T[longest_prefix]

    for i in range(1,len(INPUT)-1):
        if T[i]==longest_prefix:
            isSamePrefix = longest_prefix

    if(isSamePrefix == 0):
        print("Just a legend")
    else:
        print(INPUT[0:isSamePrefix])
 	 	  	    	 	 		 	 							   	