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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class Code_126B_Password {
    public static void main(String[] args) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out=new PrintWriter(System.out);
        StringTokenizer in=new StringTokenizer(br.readLine());
        String password=in.nextToken();

        int n=password.length();
        int[] lps=new int[n];

        int len=0,i=1;
        while (i<n){
            if(password.charAt(i)==password.charAt(len)) {
                lps[i++] = ++len;
            }else{
                if(len!=0)
                    len=lps[len-1];
                else lps[i++]=len;
            }
        }
        int length=lps[n-1];
        if (length != 0) {
            for(int j=1;j<n-1;++j) {
                if (lps[j] == length && length!=0) {
                    out.println(password.substring(0, length));
                    out.close();
                    return;
                }
            }
            length=lps[length-1];
            if(length!=0){
                for(int j=1;j<n-1;++j) {
                    if (lps[j] == length && length!=0) {
                        out.println(password.substring(0, length));
                        out.close();
                        return;
                    }
                }
            }
        }
        out.println("Just a legend");
        out.close();
    }
}