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.Vector;
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out=new PrintWriter(System.out);
        
        char[] input=in.readLine().toCharArray();
        int len=input.length;
        int[] checkPos=new int[len+1];
        checkPos[0]=-1;
        int j=-1;
        for (int i=1; i<len; i++)
        {
            while (j>=0 && input[i]!=input[j+1]) j=checkPos[j];
            if (input[i]==input[j+1]) j++;
            checkPos[i]=j;
        }
        boolean find=true;
        if (checkPos[len-1]<0 || len<3) find=false;
        if (find)
        {
            find=false;
            for (int i=0; i<len-checkPos[len-1]; i++)
            {
                if (checkPos[i]==checkPos[len-1] && i!=len-1) 
                {
                    for (int z=0; z<=checkPos[i];z++)
                    {
                        out.print(input[z]);
                    }
                    find=true;
                    break;
                }
            }
            if (checkPos[checkPos[len-1]]>=0 && !find)
            {
                for (int z=0; z<=checkPos[checkPos[len-1]];z++)
                {
                    out.print(input[z]);
                }
                find=true;
            }
        }
        if (!find) out.print("Just a legend");
        out.close();
    }

}