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.ArrayList;

public class Main {

	static String sb;

	public static void findAsterix() {
		int n = sb.length();
		char[] s = sb.toCharArray();
		int z[] = new int[n];
		int L = 0, R = 0;
		for (int i = 1; i < n; i++) {
			if (i > R) {
				L = R = i;
				while (R < n && s[R - L] == s[R])
					R++;
				z[i] = R - L;
				R--;
			} else {
				int k = i - L;
				if (z[k] < R - i + 1)
					z[i] = z[k];
				else {
					L = i;
					while (R < n && s[R - L] == s[R])
						R++;
					z[i] = R - L;
					R--;
				}
			}
		}
		int length = -1;
		int largest = -1;

		// ArrayList<Integer> indexes = new ArrayList<Integer>();
		// //ArrayList<Integer> values = new ArrayList<Integer>();
		for (int i = 0; i < n; i++) {
			int x = z[i];
			if (x == 0) {
				continue;
			} else if (largest == -1) {
				largest = x;
			} else if (x <= largest && x == n - i) {
				length = x;
				break;
			}
			else if (largest < x) {
				largest = x;
				length = -1;
			}
		}

		if (length == -1 || largest == -1) {
			System.out.println("Just a legend");
		} else {
			System.out.println(sb.substring(n - length, n));
		}

	}

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		sb = br.readLine();
		findAsterix();
	}

}