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

public class cf126b {
    public static void main(String[] args) throws Exception {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
        String s = in.readLine().trim();
        int n = s.length();
        int[] z = genZValues(s);
        int[] v = new int[n];
        for(int i=1; i<s.length(); i++)
            v[i] = Math.max(z[i],v[i-1]);
        int ret = 0;
        for(int i=1; i<s.length(); i++) {
            int j = s.length()-i;
            if(z[j] < i) continue;
            int k = j-1;
            if(k < 1)
                break;
            if(v[k] >= i)
                ret = i;
        }
        if(ret==0)
            out.println("Just a legend");
        else
            out.println(s.substring(0,ret));
        out.close();
    }
    static int[] genZValues(String s) {
        int[] z = new int[s.length()];
        for(int i=1,g=0,f=0,N=s.length(); i<N; i++) 
            if(i<g && z[i-f]!=g-i)
                z[i] = Math.min(z[i-f],g-i);
            else for(g=g>(f=i)?g:f,z[i]=g-f;g<N && s.charAt(g)==s.charAt(z[i]); g++,z[i]++);
        return z;       
    }
}