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 typing import Tuple


def comp_z(s: str) -> Tuple[int]:
    """Computes the z-array for a given string s.

        z[i] := the length of the longest substring of s, starting at index i, which is also a prefix of s.
        0 <= i < len(s); z[0] = len(s).
    """

    n = len(s)
    z = [0] * n
    z[0] = n
    # left and right boundaries of the current right most z-box [L,R)
    L, R = 0, 0

    for i in range(1, n):
        if i >= R:
            L = i
            R = i
            while R < n and s[R] == s[R-L]:
                R += 1
            z[i] = R-L
        else:  # L < i < R
            # len of  [i,R)
            x = R-i
            if x > z[i-L]:
                z[i] = z[i-L]
            else:  # x <= z[i-L] and we know s[i..R) matches prefix
                L = i
                # continue matching from R onwards
                while R < n and s[R] == s[R-L]:
                    R += 1
                z[i] = R-L

    return tuple(z)


def run():
    """Solves https://codeforces.com/contest/126/problem/B."""
    s = input()
    n = len(s)
    z = comp_z(s)

    maxz = 0
    res = 0
    for i in range(1, n):
        if z[i] == n-i and maxz >= n-i:
            res = n-i
            # break as we already found the longest one;
            # as i increases, the  length decreases
            break
        maxz = max(maxz, z[i])

    if res == 0:
        print('Just a legend')
    else:
        print(s[:res])


if __name__ == "__main__":
    run()
