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.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.*;
public class BPassword {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        String s = in.next();
//        out.println(s);
        if (s.length()==1 | s.length()==2) out.println("Just a legend");
        else {
            int[] arr = kmp(s,s,1);
            int find = arr[s.length()-1];
            int[] temp = Arrays.copyOf(arr,arr.length-1);
            Arrays.sort(temp);
            int value = temp[temp.length-1];
//            printArr(arr);
//            out.println(find+":"+value);
            while (find>value){
                String subS = s.substring(0,arr[arr.length-1]);
                arr = kmp(s,subS,1);
                find=arr[arr.length-1];
            }
            int ans = arr[arr.length-1];
            if (ans==0) out.println("Just a legend");
            else {
                for(int i=0;i<ans;i++) out.print(s.charAt(i));
            }
        }

        out.close();
    }
    static int[] kmp(String s,String s2,int start){
        int[] kmparr = new int[s2.length()];
        int j = start;int i =0;
        while (j<s2.length()){
            if(s.charAt(i)==s2.charAt(j)) {
                kmparr[j]=i+1;
                i++;
                j++;
            }
            else {
                if (i!=0)i=kmparr[i-1];
                else {
                    kmparr[j]=0;
                    j++;
                }

            }
        }
        return kmparr;
    }
    static void printArr(int[] a){
        for(int i=0;i<a.length;i++){
            System.out.print(a[i]+" ");
        }
        System.out.println();
    }
    static int binarySearch(int[] kmp,int serach){
        int l = 0;int r = kmp.length-1;
        int ret= kmp[l];
        int next=-1 ;
        while (l!=r & ret!=serach){
            if (ret!=serach) l=next+1;
            next=(int) (l+r)/2;
            ret = kmp[next];
        }
        return ret;
    }
}