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 = input()
n = len(s)

if n==1 or n==2:
	print("Just a legend")
else:
	lista = []
	for i in range(n):
		lista.append(0)
	l = 0
	lista[0] = 0
	i = 1

	while i < n:
		if s[i]==s[l]:
			l+=1
			lista[i] = l
			i += 1
		else:
			if l!=0:
				l = lista[l-1]
			else:
				lista[i] = 0
				i += 1

	ultimo = lista.pop()

	if (ultimo == 0):
		print("Just a legend")
	elif (ultimo in lista):
		print(s[:ultimo])
	elif (lista[ultimo-1] == 0):
		print("Just a legend")
	elif lista[ultimo-1]:
		print(s[:lista[ultimo-1]])
	else:
		print("Just a legend")
