Problem: 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

Solution (in PYTHON3):

Solution:
def buildZ(S):
    L, R = 0, 0
    n = len(S)
    Z = [0] * n
    # S[L:R] najdluzszy prefix-substring
    # dla obecnego i
    for i in range(1, n):
        if i > R:
            L = R = i
            while R < n and S[R-L] == S[R]:
                R+=1
            Z[i] = R - L
            R -= 1
        else:
            k = i - L
            if Z[k] < R - i + 1:
                Z[i] = Z[k]
            else:
                L = i
                while R < n and S[R-L] == S[R]:
                    R+=1
                Z[i] = R - L
                R -= 1

    return Z



if __name__ == "__main__":
    S = input().strip()
    Z = buildZ(S)

    maxz, res = 0, 0
    n = len(S)
    for i in range(1, n):
        # Z[i] == n - i
        # oznacza: na miejscu Z[i] jest prefix
        # jeśli jego długość ciągnie się do końca to 
        # jest także suffixem:
        # n = 7
        # Z[i=5] = 2, [a, b, c, d, e, a, b] Z[5] = 7-5 = 2 
        if Z[i] == n-i and maxz >= n - i:
            res = n - i
            break
        maxz = max(maxz, Z[i]) 

    if res > 0:
      print(S[0:res])
    else:
      print("Just a legend")