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
#input = stdin.readline
def main():
    #t = int(input())
    t=1
    for z in range(t):
        #n = int(input())
        #n,k  = map(int,input().split())
        #ai = list(map(int,input().split()))
        s =  input()
        s = s
        n = len(s)
        z = [0] * n
        l = 0
        r = 0
        for i in range(1,n):
                    if r >= i:
                         z[i] = min(z[i - l], r - i + 1)
                    while z[i] + i < n and s[z[i]] == s[z[i] + i]:
                         z[i]+=1
                    if i + z[i] - 1 > r:
                        l = i
                        r = i + z[i] - 1
        ar = [0]*n
        for i in range(n):
            ar[z[i]] += 1
        for i in range(n-2,-1,-1):
            ar[i] += ar[i+1]
        ans = -1
        for i in range(1,n):
            if z[i] == n-i and ar[z[i]] > 1:
                ans = i
                break
        if  ans == -1:
            print("Just a legend")
        else:
            print(s[ans:])
main()