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

public class Password {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        String str = s.next();
        int[] lps = lps(str);
        int n = str.length();
        if(lps[n-1] == 0) {
            System.out.print("Just a legend");
            return;
        }
        for(int i = 0; i < n-1; i++) {
            if(lps[i] == lps[n-1]) {
                System.out.println(str.substring(0, lps[n-1]));
                return;
            }
        }
        if(lps[lps[n-1]-1] == 0) {
            System.out.println("Just a legend");
            return;
        }
        System.out.print(str.substring(0, lps[lps[n-1]-1]));
    }

    private static int[] lps(String s) {
        int n = s.length();
        int[] lps = new int[n];
        int index = 0;
        for(int i = 1; i < n; i++) {
            if(s.charAt(i) == s.charAt(index)) {
                lps[i] = ++index;
            } else {
                if(index != 0) {
                    index = lps[index-1];
                    i--;
                } else {
                    lps[i] = index;
                }

            }
        }
        return lps;
    }
}
