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
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def lsi():
    x=list(stdin.readline())
    x.pop()
    return x
def si(): return stdin.readline()
res=['YES', 'NO']
############# CODE STARTS HERE #############
def create_z(s):
    z=[0]*len(s)
    x=y=0
    for i in range(1, len(s)):
        z[i]=max(0, min(z[i-x], y-i+1))
        while i+z[i]<len(s) and s[z[i]]==s[i+z[i]]:
            x = i
            y = i+z[i]
            z[i]+=1
    return z
a=lsi()
n=len(a)
z=create_z(a)
#print(z)
mx=max(z)
pos=z.index(mx)
m=0
for i in range(max(pos+1, n-mx), n):
    if z[i]==n-i:
        m=n-i
        break
if m<1:
    print('Just a legend')
else:
    print(*a[:m], sep='')