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
def TheZFunction(s):
	z = [0] * len(s)
	z[0] = -1
	l = r = -1
	for k in range(1,len(s)):
		if s[k] != s[0]:
			z[k] = 0
		else:
			if l<=k<=r:
				if k + z[k-l] < r:
					z[k] = z[k-l]
					continue
				if k + z[k-l] >= r:
					z[k] = r-k#Skip the known range
					i = z[k] #Counter for the prefix
					j = r
					while j < len(s) and s[i] == s[j]:
						i += 1
						j += 1
						z[k] += 1
					l = k
					r = j - 1
			else:
				i = 0 #Counter for the prefix
				j = k
				while j < len(s) and s[i] == s[j]:
					i += 1
					j += 1
					z[k] += 1
				l = k
				r = j - 1
	return z
s = input()
z = TheZFunction(s)
maxZ = 0
res = 0
n = len(s)
for i in range(1,n):
	if z[i] == n - i and maxZ >= n - i:
		res = n - i
		break
	else:
		maxZ = max(z[i],maxZ)
if res:
	print(s[:res])
else:
	print("Just a legend")