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
from sys import stdin, stdout

s = stdin.readline().rstrip()
n = len(s)

def compute_lps(s):
    lps = [0 for i in range(n)] 
    Len = 0
    lps[0] = 0
    i = 1
    while (i < n): 
        if (s[i] == s[Len]): 
            Len += 1
            lps[i] = Len
            i += 1
        else: 
            if (Len != 0): 
                Len = lps[Len - 1] 
            else: 
                lps[i] = 0
                i += 1
    return lps 

def Longestsubstring(s):
    lps = compute_lps(s) 
    if (lps[n - 1] == 0): 
        return 0
    for i in range(0,n - 1): 
        if (lps[i] == lps[n - 1]): 
            return (s[0:lps[i]]) 
    if (lps[lps[n - 1] - 1] == 0): 
        return 0
    else: 
        return (s[0:lps[lps[n - 1] - 1]])
    
res = Longestsubstring(s)

if res:
    stdout.write(res)
else:
    stdout.write('Just a legend')
