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:
from sys import stdin,stdout,setrecursionlimit,maxint,exit
#setrecursionlimit(2*10**5)
def listInput():
 return map(long,stdin.readline().split())
def printBS(li):
 for i in xrange(len(li)-1):
  stdout.write("%d "%li[i])
 stdout.write("%d\n"%li[-1])
def sin():
 return stdin.readline().rstrip()
#the problem can ve solved by generating
#KMP  prefix function
#thru it f[n] would mean longrst prefix that matches suffic
#if f[n]=0,not possibpe
#if f[n]!=0,check if any f[i] i!=n equals it
#if no such i,find f[f[n]],i.e. since 
#prefix and suffix equal..check if 
#there exist a suffix in prefix itself
#which is f[f[n]] and which ks the ans
s=sin()
m=len(s)
f=[0]*(m+1)
k=0
for i in xrange(2,m+1):
 while k>0 and s[k]!=s[i-1]:
  k=f[k]
 if s[k]==s[i-1]:
  k+=1
 f[i]=k
if f[m]!=0:
 for i in xrange(1,m):
  if f[i]==f[m]:
   print s[:f[m]]
   exit(0)
 if f[f[m]]:
  print s[:f[f[m]]]
  exit(0)
print "Just a legend"