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

public class Rextester{
    static int firstOccurance(String s,String z,int[] lps){
        int i=1,j=0;
        while(i<s.length()){
            if(s.charAt(i)==z.charAt(j)){
                i++;
                j++;
                if(j==z.length()){
                    return i-j;
                }
            }
            else{
                if(j>0){
                    j = lps[j-1];
                }
                else{
                    i++;
                }
            }
        }
        return -1;
    }
    public static void main(String[] args)throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String s = br.readLine();
        br.close();
        int n = s.length();
        int[] lps = new int[n];
        int i=1,len=0;
        while(i<n){
            if(s.charAt(i)==s.charAt(len)){
                len++;
                lps[i]=len;
                i++;
            }
            else{
                if(len>0){
                    len = lps[len-1];
                }
                else{
                    lps[i++]=len;
                }
            }
        }
        int maxPossible = lps[n-1];
        if(maxPossible>n-2){
            maxPossible = n-2;
        }
        if(maxPossible<=0){
            System.out.println("Just a legend");
            return;
        }
        String z = s.substring(0,maxPossible);
        while(true){
            z = s.substring(0,maxPossible);
            if(firstOccurance(s,z,lps)<s.length()-z.length()){
                break;
            }
            else{
                maxPossible = lps[maxPossible-1];
                if(maxPossible==0){
                    z = "Just a legend";
                    break;
                }
            }
        }
        System.out.println(z);
    }
}