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

public class Passwords {

	private static ArrayList<Integer> lps;

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String s = in.next();
		
		lps = new ArrayList<Integer>();
		
		computeLPS(s);
		search(s, lps.get(s.length() - 1));
	}
	
	public static boolean search(String s, int len) {
		if(len == 0) {
			System.out.println("Just a legend");
			return false;
		}
		for (int i = 1; i < s.length() - 1; i++) {
			if (len == lps.get(i)) {
				System.out.println(s.substring(0, len));
				return true;
			}
		}
		if(len == lps.get(len-1)) {
			System.out.println("Just a legend");
			return false;
		}
		return search(s, len=lps.get(len-1));
	}
	
	static void computeLPS(String pat) {
        int len = 0;
        int i = 1;
        lps.add(0);  
 
        while (i < pat.length()) {
            if (pat.charAt(i) == pat.charAt(len)) {
                len++;
                lps.add(i, len);
                i++;
            }
            else {
                if (len != 0) {
                    len = lps.get(len-1);
                }
                else  {
                    lps.add(i, len);
                    i++;
                }
            }
        }
    }
}