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

public class D {
    public static void main(String[] args) throws IOException{
	BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	String s = in.readLine();
	char[] c = s.toCharArray();
	int n = c.length;
	int[] memo = new int[n];
	/*  memo[i] will store the length of the longest prefix of s
	    that matches the tail of s_0...s_i-1 */

	for (int i=1; i<n; i++) {
	    int j=i;
	    while (j>0 && c[i] != c[memo[j-1]]) j = memo[j-1];
	    memo[i] = (j>0) ? memo[j-1]+1 : 0;
	}

	int max = 0;
	for (int i=1; i<n-1; i++) max = Math.max(max, memo[i]);
	/* max =  Maximum internal match to prefix  */
	int j = memo[n-1];
	while (j>max) j = memo[j-1];
	System.out.println((j==0)? "Just a legend" : s.substring(0, j));
    }
}