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
#"""
s = raw_input()
"""
s = 'ababcabababc'
s = 'abcdabc'
s = "fixprefixsuffix"
s = 'aab'
#LIM = 10**6
#s = 'a' * LIM

s = "dadaxdadaxda"

#"""
#print "STARTING"

def get_prefixes(s):
  prefix = [-1] * len(s)
  for x in xrange(1, len(s)):
    #print prefix, x, s[x]
    last_prefix = prefix[x-1]
    while True:
      #print prefix, x, last_prefix, s[last_prefix], s[x]
      if s[last_prefix+1] == s[x]:
        last_prefix += 1
        #print "PLUS", last_prefix
        break
      elif last_prefix == -1:
        break
      else:
        last_prefix = prefix[last_prefix]
        #print "MINUS", last_prefix
    prefix[x] = last_prefix

  #print s, zip(s, prefix)
  return prefix

prefix = get_prefixes(s)
suffix = get_prefixes(s[::-1])

max_len = 0
str_start = 0
max_str = 'Just a legend'
for x in xrange(1, len(s)-1):
  start = x - prefix[x]
  if prefix[x] == suffix[-start-1]:
    length = prefix[x]+1
    #print x, s[x], s[start:start+length], length, prefix[x], suffix[-start-1], max_len, start
    if length > max_len:
      max_len = length
      str_start = start

if max_len == 0:
  print "Just a legend"
else:
  print s[str_start:str_start + max_len]
