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


def z_function(s):
    z = [0] * len(s)
    l, r = 0, 0
    for i in range(1, len(s)):
        z[i] = max(0, min(z[i - l], r - i))
        while z[i] + i < len(s) and s[z[i]] == s[z[i] + i]:
            z[i] += 1
        if i + z[i] - 1 > r:
            l, r = i, i + z[i]
    return z


def prefix_function(s):
    v = [0] * len(s)
    for i in range(1, len(s)):
        k = v[i - 1]
        while k > 0 and s[k] != s[i]:
            k = v[k - 1]
        if s[k] == s[i]:
            k = k + 1
        v[i] = k
    return v


def build_hash(s):
    global hs, pw, q, p
    n = len(s)
    hs = [0] * (n + 1)
    pw = [1] * (n + 1)
    for i in range(n):
        hs[i + 1] = (hs[i] * q + ord(s[i])) % p
        pw[i + 1] = (pw[i] * q) % p


def get_hash(a, b):
    return (hs[b] - hs[a] * pw[b - a]) % p


s = input()
p = prefix_function(s)
# print(p)
if p.count(p[-1]) > 1 and p[-1] > 0:
    print(s[:p[-1]])
else:
    q = p[p[-1] - 1]
    if q > 0:
        print(s[:q])
    else:
        print("Just a legend")