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.Scanner;

public class D {                                        //AC
    static int[] z;

    public static void calc_z(String s) {
        z = new int[s.length()];
        int l = 0, r = 0;
        for (int i = 1; i < s.length(); ++i)
            if (z[i - l] + i <= r)
                z[i] = z[i - l];
            else {
                l = i;
                if (i > r)
                    r = i;
                for (z[i] = r - i; r < s.length(); ++r, ++z[i])
                    if (s.charAt(r) != s.charAt(z[i]))
                        break;
                --r;
            }
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        if (s.length() < 3) {
            System.out.println("Just a legend");
            return;
        }
        calc_z(s);
        int maxSofar = 0;
        int res = -1;
        for (int i = 1; i < s.length(); i++) {
            if (z[i] == s.length() - i && maxSofar >= z[i]) {
                res = i;
                break;
            }
            maxSofar = Math.max(maxSofar, z[i]);
        }
        if (res == -1) {
            System.out.println("Just a legend");
        } else {
            System.out.println(s.substring(res));
        }
    }
}