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

public class Password {
    public static void main(String[] args) {
        // TODO: test aaaaa, bababa
        Scanner in = new Scanner(System.in);
        String input = in.next();
        char[] pattern = input.toCharArray();
        int length = input.length();
        if (input.length() < 3) {
            System.out.println("Just a legend");
            return;
        }
        int[] vals = new int[length
                + 1]; // let vals[i] = length of longest
        vals[0] = 0;
        vals[1] = 0;
        HashSet<Integer> seen = new HashSet<>();
        for (int i = 2; i < vals.length; i++) {
            int j = vals[i - 1];
            for (; ; ) {
                // matches character
                if (pattern[j] == pattern[i - 1]) {
                    if (i != vals.length - 1) {
                        seen.add(j + 1);
                    }
                    vals[i] = j + 1;
                    break;
                }
                if (j == 0) {
                    vals[i] = 0;
                    break;
                }
                j = vals[j]; // 2nd best, while has some
            }
        }
        if (vals[vals.length - 1] == 0) {
            System.out.println("Just a legend");
        } else {
            int count = vals[vals.length - 1];
            while (count != 0) {
                if (seen.contains(count)) {
                    String res = input.substring(0, count);
                    System.out.println(res);
                    return;
                }
                count = vals[count];
            }
            System.out.println("Just a legend");
        }

    }
}