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:
import sys
import bisect
input_=lambda: sys.stdin.readline().strip("\r\n")
from math import log
from math import gcd
from random import randint
sa=lambda :input_()
sb=lambda:int(input_())
sc=lambda:input_().split()
sd=lambda:list(map(int,input_().split()))
se=lambda:float(input_())
sf=lambda:list(input_())
flsh=lambda: sys.stdout.flush()
#sys.setrecursionlimit(10**6)
mod=10**9+7
gp=[]
cost=[]
dp=[]
mx=[]
def dfs(root,par):
    global gp,cost,dp
    dp[root]=cost[root]
    for i in gp[root]:
        if i==par:continue
        dfs(i,root)
        dp[root]=max(dp[root],dp[i])
def z_algo(ar):
    n=len(ar)
    ans=[0]*n
    l,r=0,0
    ans[0]=n
    for i in range(1,n):
        if(i<=r):
            ans[i]=min(r-i+1,ans[i-l])
        while(i+ans[i]<n and ar[ans[i]]==ar[i+ans[i]]):
            ans[i]+=1
        if i+ans[i]-1>r:
            l=i
            r=i+ans[i]-1
    return ans
def hnbhai():
    s=sa()
    n=len(s)
    z=z_algo(s)
    #print(z)
    count=[0]*(n+1)
    mark=[0]*(n+1)
    tot=0
    for i in range(n-1,-1,-1):
        if z[i]+i==n:
            mark[z[i]]=1
            tot+=1
    for i in range(n):
        count[z[i]]+=1
    for i in range(n-1,-1,-1):
        count[i]+=count[i+1]
    for i in range(n-1,-1,-1):
        if mark[i] and count[i]>2:
            print(s[:i])
            return
    print("Just a legend")
for _ in range(1):
    hnbhai()