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 get_lps(string):
    n = len(string) 
    long_pref_suff = [0 for i in range(n)]
    size = 0
    long_pref_suff[0] = 0
    i = 1
    while (i < n):
        if (string[i] == string[size]):
            size += 1
            long_pref_suff[i] = size
            i += 1
        else:
            if (size != 0):
                size = long_pref_suff[size - 1]
            else:
                long_pref_suff[i] = 0
                i += 1
    return long_pref_suff
def get_longest_substr(string):
    long_pref_suff = get_lps(string)
    n = len(string)
    if (long_pref_suff[n - 1] == 0):
        return -1
    for i in range(0,n - 1):
        if (long_pref_suff[i] == long_pref_suff[n - 1]): 
            return string[0:long_pref_suff[i]]
    if (long_pref_suff[long_pref_suff[n - 1] - 1] == 0):
        return -1
    else:
        return string[0:long_pref_suff[long_pref_suff[n - 1] - 1]]

def main(string):
    res = get_longest_substr(string)
    if res == -1:
        print('Just a legend')
    else:
        print(res)

main(input())
 				  	    	 		    	  		    		