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

public class lost {

	static int[] b;

	static int kmpPreprocess(String substr) {
		int m = substr.length(), maxi = 0;
		b = new int[m + 12];
		int i = 0, j = -1;
		b[i] = -1;
		while (i < m) {
			while (j >= 0 && substr.charAt(i) != substr.charAt(j))
				j = b[j];
			i++;
			j++;
			b[i] = j;
			if (i != m)
				maxi = Math.max(maxi, b[i]);
		}
		return maxi;
	}

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		int maxi = kmpPreprocess(str);
		int temp = str.length();
		boolean mark = true;
		int temp1 = b[temp];
		temp = temp1;
		temp1 = b[temp];
		if (temp1 == 0) {
			mark = false;
		}
		temp = temp1;
		if (b[str.length()] == 0) {
			System.out.println("Just a legend");
			return;
		}
		int temp2 = 0;
		if (b[str.length()] <= maxi)
			temp2 = 1;
		if (temp2 == 0) {
			if (mark) {
				System.out.print(str.substring(0, temp));
			} else
				System.out.println("Just a legend");
		} else
			System.out.print(str.substring(0, b[str.length()]));

	}
}