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.util.ArrayList;
import java.util.Scanner;

public class Password {

	static ArrayList<Integer> longestPrefix;

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);

		String s = in.next();
		longestPrefix = new ArrayList();// new object
		computePrefix(s);// Prefix function

		boolean found = false;
		int len;// the length of the answer

		len = longestPrefix.get(s.length() - 1);

		if (len != 0) {
			for (int j = 0; j < 2; j++) {
				for (int i = 1; i < s.length() - 1; i++) {
					if (len == longestPrefix.get(i)) {
						found = true;
						break;
					}

				}
				if (!found) {
					len = longestPrefix.get(len - 1);
					if (len == 0)
						break;
				} else
					break;
			}

		}
		if (!found || len == 0) {
			System.out.println("Just a legend");
		} else {
			System.out.println(s.substring(0, len));
		}

	}

	public static void computePrefix(String str) {
		longestPrefix.add(0);
		int m = str.length();
		for (int i = 1, k = 0; i < m; i++) {
			while (k > 0 && str.charAt(k) != str.charAt(i)) {
				k = longestPrefix.get(k - 1);
			}

			if (str.charAt(k) == str.charAt(i)) {
				longestPrefix.add(i, ++k);
			} else {
				longestPrefix.add(i, k);
			}
		}
	}
}