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
def min(x,y):
    if(x<y):
        return x
    else:
        return y
def max(x,y):
    if(x>y):
        return x
    else:
        return y
def binarysearch(a,x,first,last):
    if a[last]<=x:
        return a[last]
    if a[first]>x:
        return 0
    mid=(first+last)//2
    if a[mid]==x:
        return x
    if a[mid]<x and a[mid+1]>x:
        return a[mid]
       
    if a[mid]<x:
        return binarysearch(a,x,mid,last)
    return binarysearch(a,x,first,mid)
s=stdin.readline().strip()
if len(s)==1:
    print("Just a legend")
    exit()

z=[]
for i in range(len(s)):
    z.append(0)
x=0
y=0
n=len(s)
for i in range(1,n):
    z[i]=max(0,min(z[i-x],y-i+1))
    while i+z[i]<n and s[z[i]]==s[i+z[i]]:
        x=i
        y=i+z[i]
        z[i]+=1
a=[0]
for i in range(len(s)-1,-1,-1):
    if z[i]==len(s)-i:
        a.append(len(s)-i)

ans=0
mx=0
v=[]
for i in range(1,n):
    if z[i]+i==n:
        v.append(z[i])
        mx=max(mx,z[i]-1)
    else:
        mx=max(mx,z[i])
for i in range(0,len(v)):
    t = v[i]
    if t <= mx:
        ans = max(ans,t)
if ans==0:
    print("Just a legend")
else:
    for i in range(0,ans):
        print(s[i],end='')
    