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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;

public class z_function {
    static StreamTokenizer st;
    static String s;

    public static void main(String[] args) throws IOException {
        st = new StreamTokenizer(new BufferedReader(new InputStreamReader(
                System.in)));
        s = next();
        int a[] = z_function(s);
        int max = 0;
        int x = 0;
        for (int i = 0; i < a.length; i++) {
            if (a[i] > 0 && s.length() - i == a[i]) {
                x = a[i];
                break;
            }
        }
        int b[] = new int[1000000];
        for (int i = 0; i < a.length; i++) {
            b[a[i]]++;
        }
        for (int i = 0; i < b.length; i++) {
            if (b[i] > 3) {
                max = i;
            }
        }
        int k = 0;
        for (int i = 0; i < b.length; i++) {
            for (int j = 0; j < b[i]; j++) {
                a[k++] = i;
            }
        }
        // nmkjnmkinmkunm
        PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
        if (s.length() > 2) {
            for (int i = a.length - 2; a[i] > 0; i--) {
                if (x >= a[i] && s.charAt(a[i] - 1) == s.charAt(s.length() - 1)) {
                    pw.println(s.substring(s.length() - a[i], s.length()));
                    pw.close();
                    return;
                }
            }
        }
        pw.println("Just a legend");
        pw.close();
    }

    private static String next() throws IOException {
        st.nextToken();
        return st.sval;
    }

    static public int[] z_function(String s) {
        int m = s.length();
        int z[] = new int[m];
        for (int i = 1, l = 0, r = 0; i < m; ++i) {
            if (i <= r) {
                z[i] = Math.min(r - i + 1, z[i - l]);
            }
            while (i + z[i] < m && s.charAt(z[i]) == s.charAt(i + z[i])) {
                ++z[i];
            }
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        return z;
    }
}