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.*;
import java.io.*;
public class Main{
    static int z[];
    public static void main(String args[]){
        Scanner sc=new Scanner(System.in);
        String str=sc.next();
        z=new int[str.length()];
        calculate(str);
        int maxz=0,res=0;
        int n=str.length();
        for(int i=1;i<n;i++){
            if(z[i]==n-i&&maxz>=n-i){res=n-i;break;}
            maxz=Math.max(maxz,z[i]);
        }
        
        if(res==0)
        System.out.println("Just a legend");
        else
        System.out.println(str.substring(0,res));
    }
    public static void calculate(String str){
        int l=0,r=0,n=str.length();
        for(int i=1;i<str.length();i++){
            if(i>r){
                l=r=i;
                while(r<n&&str.charAt(r-l)==str.charAt(r))r++;
                z[i]=r-l;r--;
            }else{
                int k=i-l;
                if((r-i+1)>(z[k]))z[i]=z[k];
                else{
                    l=i;
                    r=r+1;
                    while(r<n&&(str.charAt(r-l)==str.charAt(r)))r++;
                    z[i]=r-l;r--;
                }
            }
        }
    }
}