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;

/**
 *
 * @author quangpham
 */
public class B {

    public void run() {
        Scanner scanner = new Scanner(System.in);

        String s = scanner.next();
        char[] a = s.toCharArray();
        int n = a.length;

        int[] z = new int[n];
        for (int i = 1, L = 0, R = 0; i < n; ++i) {
            if (i > R) {
                z[i] = 0;
            } else {
                z[i] = Math.min(z[i - L], R - i + 1);
            }
            while (i + z[i] < n && a[i + z[i]] == a[z[i]]) {
                ++z[i];
            }
            if (z[i] > R) {
                L = i;
                R = i + z[i] - 1;
            }
        }

        int result = -1;
        int howlong = 0;
        for (int i = 1; i < n; ++i) {
            if (z[i] == n - i && howlong >= z[i]) {
                result = Math.max(result, z[i]);
            } else {
                howlong = Math.max(howlong, z[i]);
            }
        }

        if (result == -1) {
            System.out.println("Just a legend");
        } else {
            System.out.println(s.substring(0, result));
        }

        scanner.close();
    }

    public static void main(String[] args) {
        new B().run();
    }
}