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.*;
import java.math.*;

public class Main {
        private static int[] getNextArray(String str){
                int[] arr = new int[str.length()];
                int i = 1, j = -1;
                arr[0] = -1;
                while(i < str.length()){
                        if(j == -1 || str.charAt(i - 1) == str.charAt(j)){
                                arr[i] = j + 1;
                                i++;
                                j++;
                        }
                        else{
                                j = arr[j];
                        }
                }
                return arr;
        }
        
        public static void main(String[] args) throws Exception{
                Scanner scan = new Scanner(System.in);
                String str = scan.nextLine();
                if(str.length() <= 2){
                        System.out.println("Just a legend");
                        return;
                }
                int[] next = getNextArray(str);
                //System.out.println(Arrays.toString(next));
                int i=1;
		int j=0;
                int max = 0;
		while(i < str.length() - 1 && j < str.length()){
			if(str.charAt(i) == str.charAt(j))
			{
				++i;
				++j;
                                max = Math.max(max, j);
			}
                        else if(j == 0){
                                i++;
                        }
                        else{
                                j = next[j];
                        }
                }
                //.out.println(max);
                i = str.length() - max;
                j = 0;
                while(i < str.length() && j < str.length()){
			if(str.charAt(i) == str.charAt(j))
			{
				++i;
				++j;
			}
                        else{ 
                                j=next[j];
                                if(j == -1){
                                        i++;
                                        j = 0;
                                }
                        }
                }
                if(j > 0){
                        System.out.println(str.substring(0, j));
                }
                else{
                        System.out.println("Just a legend");
                }
        }
}