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 sys import stdin,stdout
from collections import defaultdict,Counter
from bisect import bisect
import math
#stdin = open('input.txt','r')

def ps(s):
    n = len(s)
    pre = [0 for i in range(n)]
    j = 0
    i = 1
    while(i<n):
        if(s[j] == s[i]):
            j+=1
            pre[i] = j
            i+=1
        else:
            if(j!=0):
                j = pre[j-1]
            else:
                pre[i] = 0
                i+=1
    
        #print(pre[i],j)
        
    return pre



I = stdin.readline

s = I().rstrip()
arr = ps(s)
pn = arr[-1]
#print(pn)
flag = 0
if(pn!=0):
    for i in range(len(s)-1):
        if(arr[i] == pn):
            flag = 1
            break
#print([s[i] for i in range(len(s))])
#print(arr)

if(flag == 1):
    print(s[0:pn])
else:
    pn = arr[pn-1]
    if(pn != 0): flag = 1
    if(flag == 1):
        print(s[0:pn])
    else:
        print("Just a legend")













    

    




