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:
// http://codeforces.com/contest/126/problem/B
import java.util.Scanner;
public class Password {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		char[] s = in.next().toCharArray();
		in.close();
		
		int[] arr = new int[s.length];
		int i = 1, j = 0;
		while(i < s.length) {
			if(s[i] ==  s[j]) {
				arr[i] = j+1;
				i++;
				j++;
			}
			else {
				while(s[i] != s[j] && j > 0)
					j = arr[j-1];
				if(s[i] != s[j])
					i++;
			}
		}
		
		// length of candidate
		int x = arr[arr.length-1];
		if(x == 0 || s.length < 3)
			fail();
		
		for(i = 1; i < s.length-1; i++)
			if(arr[i] == x)
				succeed(s, x);
		
		if(arr[x-1] == 0)
			fail();
		succeed(s, arr[x-1]);
		
//		// consider string minus first and last chars
//		int[] arrc = new int[s.length-2];
//		char[] center = new String(s, 1, s.length-2).toCharArray();
//		i = 1; j = 0;
//		while(i < center.length) {
//			if(center[i] == center[j]) {
//				arrc[i] = j+1;
//				i++;
//				j++;
//			}
//			else {
//				while(center[i] != center[j] && j > 0)
//					j = arrc[j-1];
//				if(center[i] != center[j])
//					i++;
//			}
//		}
//		
//		// is candidate string in center?
//		int depth = 0;
//		for(i = 0; i < center.length; i++) {
//			if(center[i] == s[depth]) {
//				if(++depth == x)
//					succeed(s, x);
//			}
//			else
//				depth = arrc[i];
//		}
//		
//		// candidate string not in center
//		x = arr[x-1];
//		if(x == 0)
//			fail();
//		succeed(s, x);
	}
	
	public static void fail() {
		System.out.print("Just a legend");
		System.exit(0);
	}
	
	public static void succeed(char[] s, int len) {
		System.out.print(new String(s, 0, len));
		System.exit(0);
	}
}