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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public final class Password {

	static void computeLPSArray(String pat, int M, int lps[]) {
		// length of the previous longest prefix suffix
		int len = 0;
		int i = 1;
		lps[0] = 0; // lps[0] is always 0

		// the loop calculates lps[i] for i = 1 to M-1
		while (i < M) {
			if (pat.charAt(i) == pat.charAt(len)) {
				len++;
				lps[i] = len;
				i++;
			} else if (len != 0) {
				len = lps[len - 1];
			} else // if (len == 0)
			{
				lps[i] = len;
				i++;
			}
		}
	}

	public static void main(String args[]) throws IOException {
		BufferedReader input = new BufferedReader(new InputStreamReader(System.in));
		String s = input.readLine();

		int n = s.length();
		int p[] = new int[n];

		computeLPSArray(s, n, p);

		if (p[n - 1] == 0) {
			System.out.println("Just a legend");
			return;
		}

		for (int i = 0; i < n - 1; i += 1)
			if (p[i] == p[n - 1]) {
				System.out.println(s.substring(0, p[i]));
				return;
			}

		if (p[p[n - 1] - 1] == 0) {
			System.out.println("Just a legend");
			return;
		}

		System.out.println(s.substring(0, p[p[n - 1] - 1]));
	}
}
