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.Scanner;
import java.io.PrintWriter;
public class D93 {
	static Scanner in = new Scanner(System.in);
	static PrintWriter w = new PrintWriter(System.out, true);

	static int ni() {
		return in.nextInt();
	}

	static String nl() {
		return in.nextLine();
	}

	public static void main(String[] args) {
		String s = nl();
		int l = s.length();
		char[] c = new char[l];
		s.getChars(0, l, c, 0);
		int[] p1 = new int[l];

        p1[0] = 0;
 
        int k = 0;
        for(int i = 1; i < l; i++) {               
                while ( (k > 0) && c[k] != c[i])
                        k = p1[k-1]; 
                if (c[k] == c[i])
                        k++;
                p1[i] = k;
        }
        int m = p1[l-1];
        while (m > 0) {
        	for (int i = 1; i < l-1;i++)
        		if (p1[i]==m) {
        			w.println(s.substring(0, m));
        			return;
        		}
        	m = p1[m-1];
        }
        w.println("Just a legend");
		
		
	}
}