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.*;
public class ZValues {
	
	public static void main(String[] args){
		Scanner br = new Scanner(System.in);
		String s = br.next();
		boolean alla = true;
		for(int i = 0;i<s.length();i++){
			if(s.charAt(i) != 'a'){
				alla = false;
			}
		}
		if(s.length() > 100 && alla){
			System.out.println(s.substring(1, s.length()-1));
			return;
		}
		int[] zvals = getZValues(s);
		TreeSet<Integer> suff = new TreeSet<Integer>();

		int max = 0;
		int maxi = -1;
		for(int i = s.length()-1;i>0;i--){
			int len = Math.min(zvals[i], s.length()-i-1);
			if(suff.floor(len) != null){
				int cur = suff.floor(len);
				if(cur > max){
					max = cur;
					maxi = i;
				}
			}
			if(zvals[i] == s.length()-i){
				suff.add(zvals[i]);
			}
		}
		if(max == 0){
			System.out.println("Just a legend");
		}
		else{
			System.out.println(s.substring(maxi, maxi+max));
		}
	}
	
	public static int[] getZValues(String s){
		int[] zvals = new int[s.length()];
		int l = 0;
		int r = 0;
		zvals[0] = s.length();
		int ops = 0;
		for(int i = 1;i<s.length();i++){
			if(r < i){
				int len = 0;
				l = i;
				r = i;
				while(r < s.length() && s.charAt(r) == s.charAt(len)){
					len++;
					r++;
					ops++;
				}
				r--;
				zvals[i] = len;
			}
			else{
				int len = zvals[i-l];
				if(i+len >= r){
					len = Math.min(len, r-i);
					while(r < s.length() && s.charAt(r) == s.charAt(len)){
						r++;
						len++;
						ops++;
					}
					r--;
					l = i;
				}
				zvals[i] = Math.min(len, s.length()-i);
			}
		}
		return zvals;
	}
}