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

public class password {

	static int lps[];

	static void computeLPS(char[] T) {
		lps = new int[T.length];
		int j = 0;
		int i = 1;
		while (i < T.length) {
			if (T[i] == T[j]) {
				lps[i] = j + 1;
				i++;
				j++;
			} else {
				if (j != 0) {
					j = lps[j - 1];
				} else {
					lps[i] = 0;
					i++;
				}
			}
		}
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		char T[] = sc.next().toCharArray();
		if(T.length <= 2)
		{
			System.out.println("Just a legend");
			return;
		}
		char S[] = new char[T.length];
		for (int i = 0; i < S.length; i++) {
			S[i] = T[T.length - i - 1];
		}
		computeLPS(T);
//		for (int i = 0; i < T.length; i++) {
//			System.out.print(lps[i] + " ");
//		}
		boolean ok = true;
		if (lps[lps.length - 1] == 0)
			ok = false;
		int idx = -1;
		for (int i = 1; i < lps.length - 1 && ok; i++) {
			if (lps[i] == lps[lps.length - 1]) {
				ok = true;
				idx = i;
			}
		}
		StringBuilder sb ;
		if (ok && idx != -1) {
			 sb = new StringBuilder();
			for (int i = idx - lps[idx] + 1; i <= idx; i++) {
				sb.append(T[i]);
			}
//			System.out.println(sb);
		} else {
			idx = lps[lps.length - 1] - 1;
			if(idx == -1)
			{
				System.out.println("Just a legend");
				return;
			}
			if (lps[lps[lps.length - 1] - 1] == 0) {
				System.out.println("Just a legend");
				return;
			} else {
				 sb = new StringBuilder();
				for (int i = idx - lps[idx] + 1; i <= idx; i++) {
					sb.append(T[i]);
				}
//				System.out.println(sb);
			}
			idx = lps[lps[lps.length - 1]];
//			System.out.println(idx);
		}
		
		if(sb.length() == 0)
			System.out.println("Just a legend");
		else
			System.out.println(sb);
	}
}
