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

public class Main {
    public static void main(String[] args) throws IOException {
        Scanner cin = new Scanner(System.in);
        StringBuilder cs = new StringBuilder(cin.next());
        int len = cs.length();
        int cv[] = new int[len];
        for (int i = 0; i < len; i++)
            cv[i] = -1;
        int f = -1, x = -1;
        cv[0] = len - 1;
        for (int i = 1; i < len; i++) {
            int cd = -1;
            if (x >= i) {
                if (cv[i - f] < x - i) {
                    cv[i] = cv[i - f];
                    continue;
                }
                cd = x - i;
            }
            f = i;
            x = cd + i + 1;
            for (int y = x - f; x < len; x++, y++)
                if (cs.charAt(x) != cs.charAt(y)) break;
            cv[i] = --x - i;
        }
//        for (int i = 0; i < len; i++)
//            System.out.print(cv[i] + " ");
//        System.out.println();
        int op[] = new int[len];
        for (int i = 1; i < len; i++) {
            if (cv[i] == -1) continue;
            int d = cv[i];
            op[d] += 2;
            if (i + d == len - 1) op[d] |= 1;
        }
        for (int i = len - 2; i >= 0; i--)
            op[i] += (op[i + 1] >> 1) << 1;
//        for (int i = 0; i < len; i++)
//            System.out.print((op[i] >> 1) + "(" + (op[i] & 1) + ") ");
//        System.out.println();
        int Res = -1;
        for (int i = len - 1; i >= 0; i--)
            if ((op[i] & 1) > 0 && (op[i] >> 1) > 1) {
                Res = i;
                break;
            }
        System.out.println(Res > -1 ? cs.substring(0, Res + 1)
                : "Just a legend");
    }
}