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 PYTHON):

Solution:
import sys
import os
import math

s=raw_input()
n=len(s)
p=[0]*1000009
c=[0]*1000009

j=0
for i in range(1,n):
    while j>0 and s[j]!=s[i]:
        j=p[j-1]
    if s[j]==s[i]:
        j+=1
    p[i]=j
    if j>0:
        c[j]+=1
len1=-1
i=p[n-1]
while True:
    if i==0: break
    if c[i]>=2: len1=max(len1,i)
    if(p[i-1]!=0): len1=max(len1,p[i-1])
    i=p[i-1]
if len1==-1: print 'Just a legend'
else:
    ss=s[0:len1]
    print ss