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:
import sys
from array import array  # noqa: F401
from collections import Counter


def input():
    return sys.stdin.buffer.readline().decode('utf-8')


def z_algorithm(S):
    n = len(S)
    Z = [n] + [0] * (n - 1)
    i, j = 1, 0

    while i < n:
        while i + j < n and S[j] == S[i + j]:
            j += 1
        Z[i] = j

        if j == 0:
            i += 1
            continue

        k = 1
        while k < j and k + Z[k] < j:
            Z[i + k] = Z[k]
            k += 1

        i += k
        j -= k

    return Z


s = input().rstrip()
n = len(s)
z = z_algorithm(s)
freq = Counter(z[1:])
ans = -1
max_pre = max(z[1:], default=0)

for slen in range(1, n - 1):
    freq[z[n - slen]] -= 1
    while freq[max_pre] == 0:
        max_pre -= 1
    if max_pre >= slen and z[n - slen] == slen:
        ans = slen

print(s[:ans] if ans > -1 else 'Just a legend')