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

public class Main {
    public static void main(String[] args) {
        new Password().solve();
    }
}

class Password {
    private int[] nextSuffix;

    private int[] zetFunction (String s) {
        int[] z = new int[s.length()];
        z[0] = 0;
        int left = 0;
        int right = 0;

        for (int i = 1; i < s.length(); i++) {
            if (i > right) {
                int j = 0;

                while ((i + j < s.length()) && (s.charAt(i + j) == s.charAt(j))) {
                    j++;
                }

                z[i] = j;
                left = i;
                right = i + j - 1;
            } else {
                if (z[i - left] < right - i + 1) {
                    z[i] = z[i - left];
                } else {
                    int j = 1;

                    while ((j + right < s.length()) && (s.charAt(right + j - i) == s.charAt(right + j))) {
                        j++;
                    }

                    z[i] = right + j - i;
                    left = i;
                    right = right + j - 1;
                }
            }
        }

        return z;
    }

    public void solve() {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        String s = in.next();

        int[] z = zetFunction(s);

        boolean[] isSuffix = new boolean[s.length()], isSubstring = new boolean[s.length()];
        Arrays.fill(isSuffix,false); Arrays.fill(isSubstring,false);

        for (int i = 1; i < s.length(); ++i) {
            if (i + z[i] == s.length()) {
                isSuffix[i] = true;
            } else {
                if (z[i] != 0) {
                    isSubstring[i] = true;
                }
            }
        }

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

        for (int i = s.length() - 1; i > 0; --i) {
            if (isSuffix[i]) {
                nextSuffix[i] = i;
            } else {
                if (i != s.length() - 1) {
                    nextSuffix[i] = nextSuffix[i + 1];
                } else {
                    nextSuffix[i] = 0;
                }
            }
        }

        int max = 0;

        for (int i = 1; i < s.length(); ++i) {
            if (isSubstring[i]) {
                if (nextSuffix[s.length() - z[i]] != 0) {
                    max = Math.max(max,s.length() - nextSuffix[s.length() - z[i]]);
                }
            }
        }

        boolean wasSuffix = false;

        for (int i = 1; i < s.length(); ++i) {
            if (isSuffix[i]) {
                if (wasSuffix) {
                    max = Math.max(max,z[i]);
                    break;
                } else {
                    wasSuffix = true;
                }
            }
        }

        if (max == 0) {
            out.println("Just a legend");
        } else {
            out.println(s.substring(0, max));
        }

        out.close();
    }
}