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 kmp_diagnose(pattern):
	plen = len(pattern)
	longest_prefix = [0 for _ in range(plen)]
	for i in range(1, plen):
		longest_prefix[i] = longest_prefix[i - 1]

		while longest_prefix[i] >= 0:
			if pattern[i] == pattern[longest_prefix[i]]:
				longest_prefix[i] += 1
				break
				
			if longest_prefix[i] == 0: break
			longest_prefix[i] = longest_prefix[longest_prefix[i] - 1]
	
	return longest_prefix

def longest_midfix(string):
	n, longest_prefix = len(string), kmp_diagnose(string)
	allowed_midfix_length = set()
	max_allowed = longest_prefix[n - 1]
	while max_allowed > 0:
		allowed_midfix_length.add(max_allowed)
		max_allowed = longest_prefix[max_allowed - 1]

	longest = 0
	for i in range(n-1):
		if longest_prefix[i] in allowed_midfix_length:
			longest = max(longest, longest_prefix[i])
	
	if longest > 0: return string[:longest]
	return 'Just a legend'

s = input()
print(longest_midfix(s))