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.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.regex.*;
import static java.lang.Math.*;
public class B {

    public static int[] failure(char[] w) {
        int cnd = 0;
        int[] t = new int[w.length];
        if (w.length > 0) t[0] = -1;
        if (w.length > 1) t[1] = 0;
        for (int pos = 2; pos < w.length;) {
            if (w[pos - 1] == w[cnd]) {
                cnd++;
                t[pos] = cnd;
                pos++;
            } else if (cnd > 0) {
                cnd = t[cnd];
            } else {
                t[pos] = 0;
                pos++;
            }
        }
        return t;
    }

    public B() throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String s = br.readLine();
        int[] pi = failure((s+"$").toCharArray());
        boolean[] has = new boolean[s.length()];
        for (int i=1; i<s.length(); i++) has[pi[i]] = true;
        int t = pi[s.length()];
        while (!has[t] && t>0 ) t = pi[t];
        if (t==0) buf.append("Just a legend\n");
        else {
            for (int i=0; i<t; i++) buf.append(s.charAt(i));
            buf.append('\n');
        }
    }

    public static Scanner in = new Scanner(System.in);
    public static StringBuilder buf = new StringBuilder();
    public static void debug(Object... arr) { // {{{
        System.err.println(Arrays.deepToString(arr));
    } // }}}
    public static void main(String[] args) throws Exception { // {{{
        new B();
        System.out.print(buf);
    } // }}}
    
}