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
s = input()
def count_unique_substring(s):
    n = len(s)
    p = 31
    m = 10**9 + 9
    p_pow = [1]
    for i in range(1,n):
        p_pow.append((p_pow[i-1]*p)%m)
    hash = [0]
    count = 0
    flag=0
    for i in range(n):
        hash.append(( hash[i] + (ord(s[i])-ord('a')+1) * p_pow[i]) % m)
    for l in range(n,0,-1):
        c_1 = (hash[ l] + m - hash[0]) % m
        c_1 = c_1 * p_pow[n - 1] % m
        c_2 = (hash[n-l + l] + m - hash[n-l]) % m
        c_2 = c_2 * p_pow[l - 1] % m
        if c_1 == c_2:
            for i in range(1,n-l):
                c_h = (hash[i+l] + m - hash[i]) % m
                c_h = c_h * p_pow[n-i-1]%m
                if c_h == c_2:
                    return (s[i:i+l])

t = count_unique_substring(s)
if t:
    print(t)
else:
    print('Just a legend')
