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 subhash(l, r):
    global un_h
    global pw
    big = un_h[r]
    small = 0
    if l > 0:
        small = (un_h[l - 1] * pw[r - l + 1]) % mod
    return (big - small + mod) % mod


def HASH(st):
    global p
    global mod
    un_h = [0] * len(st)
    un_h[0] = ord(st[0])
    for i in range(1, len(st)):
        un_h[i] = (un_h[i - 1] * p + ord(st[i])) % mod
    return un_h


def hash2(st, hash3 = 0):
    global p
    global mod
    for i in range(len(st)):
        hash3 = (hash3 * p + ord(st[i])) % mod
    return hash3


p = 29
mod = 10 ** 9 + 7
str1 = input()
pw = [1] * (len(str1) + 1)
for i in range(1, len(pw)):
    pw[i] = pw[i - 1] * p % mod
un_h = HASH(str1)
ans = "Just a legend"
prefs = [0]
for z in range(0, len(str1) - 2):
    if (subhash(0, z)== subhash(len(str1) - 1 - z, len(str1) - 1)):
        prefs.append(z + 1)
r = len(prefs)
l = 0
while r - l != 1:
    m = (r + l) // 2
    hash1 = subhash(0, prefs[m] - 1)
    i = 1
    j = prefs[m]
    t = False
    while j < len(str1) - 1:
        H = subhash(i, j)
        if H == hash1:
            l = m
            t = True
            break
        i += 1
        j += 1
    if t == False:
        r = m
if prefs[l] == 0:
    print(ans)
else:
    print(str1[:prefs[l]])
