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 bisect import bisect_left as bl, bisect_right as br, insort
import sys
import heapq
#from math import *
from collections import defaultdict as dd, deque
def data(): return sys.stdin.readline().strip()
def mdata(): return map(int, data().split())
#def print(x): return sys.stdout.write(str(x)+'\n')
#sys.setrecursionlimit(100000)
mod=int(1e9+7)

def KMPSearch(pat, txt):
	M = len(pat)
	N = len(txt)
	lps = [0]*M
	j = 0
	computeLPSArray(pat, M, lps)

	i = 0
	while i < N:
		if pat[j] == txt[i]:
			i += 1
			j += 1

		if j == M:
			return pat[:M],lps

		elif pat[j] != txt[i]:
			if j != 0:
				j = lps[j-1]
				M-=1
				lps.pop()
			else:
				i += 1

def computeLPSArray(pat, M, lps):
    l = 0
    lps[0]=0
    i = 1

    while i < M:
        if pat[i]== pat[l]:
            l += 1
            lps[i] = l
            i += 1
        else:
            if l != 0:
                l = lps[l-1]

            else:
                lps[i] = 0
                i += 1
    return lps

s=data()
n=len(s)
lps1=[0]*n
lps1=computeLPSArray(s,n,lps1)
lps2=[0]*n
lps2=computeLPSArray(s[::-1],n,lps2)
m=0
for i in range(n):
   if lps1[i]==lps2[n-2-i+lps1[i]]:
       m=max(m,lps1[i])
if m==0:
    print("Just a legend")
else:
    print(s[:m])


