Problem: 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

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Passwords {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		char[] str = in.readLine().toCharArray();
		int[] z = new int[str.length];
		int l = -1;
		int r = -1;
		z[0] = str.length;
		for (int i = 1; i < str.length; i++) {
			if (i > r) {
				l = r = i;
				while (r < str.length && str[r] == str[r - l])
					r++;
				z[i] = r-- - l;
			} else if (z[i - l] < r - i + 1) {
				z[i] = z[i - l];
			} else {
				l = i;
				while (r < str.length && str[r] == str[r - l])
					r++;
				z[i] = r-- - l;
			}
		}
		int mx = 0;
		int best = 0;
		for (int i = 1; i < str.length; i++) {
			if (z[i] + i == str.length && z[i] <= mx)
				best = Math.max(best, z[i]);
			mx = Math.max(mx, z[i]);
		}
		String s = new String(str);
		if (best == 0)
			System.out.println("Just a legend");
		else
			System.out.println(s.substring(0, best));
	}
}