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
#!/usr/bin/env python3
# created : 2020. 12. 31. 23:59

import os
from sys import stdin, stdout


def getPrefixFunction(w):
    m = len(w)
    pf = [0 for i in range(m)]
    j = 0
    for i in range(1, m):
        while j > 0 and w[i] != w[j]:
            j = pf[j-1]

        if w[i] == w[j]:
            j += 1
            pf[i] = j

    return pf


def solve(tc):
    s = stdin.readline().strip()
    n = len(s)
    pf = getPrefixFunction(s)
    if pf[n-1] == 0:
        print("Just a legend")
        return

    for i in range(1, n-1):
        if pf[i] == pf[n-1]:
            print(s[:pf[n-1]])
            return

    k = pf[pf[n-1]-1]
    if k > 0:
        print(s[:k])
        return
    
    print("Just a legend")


tcs = 1
# tcs = int(stdin.readline().strip())
tc = 1
while tc <= tcs:
    solve(tc)
    tc += 1
