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
//package semanai;
import java.util.Scanner;

public class Password {
    

    public static void populate(String str, int p[]){
        int length = str.length();
        p[0] = 0;
        for (int i = 1; i < length; i++) {
            int j = p[i - 1];
            while (( j > 0) && (str.charAt(i) != str.charAt(j)) ) {
                j = p[j - 1];
            }
            if (str.charAt(i) == str.charAt(j)) {
                j++;
            }
            p[i] = j;
        }

    }

    public static String interpretate(String s,int[] behavior){
        int size = s.length() - 1;
        if(behavior[size] == 0){    //si todas las letras son diferentes
            return "";
        }
        if(behavior[size] == size){
            return s.substring(0,size-1);//si todas las letras son iguales
        }
        for(int i = 1; i < size; i++){
            if(behavior[i] == behavior[size])
                return s.substring(0,behavior[size]);
        }

        if(behavior[behavior[size] - 1] == 0){
            return "";
        }

        for(int i = behavior[behavior[size] - 1]; i < size; i++){
            if(behavior[i] == behavior[behavior[size] - 1]) {
                return s.substring(0, behavior[i]);
            }
        }

        return "";

    }

    public static void main(String[] args) {
        String answer;

        Scanner sc = new Scanner(System.in);
        String s = sc.next();

        int[] behavior = new int[s.length()];

        populate(s, behavior);


        answer = interpretate(s,behavior);

        if(!answer.equals("")){
            System.out.println(answer);
        }
        else{
            System.out.println("Just a legend");
        }


    }

}
