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 main {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);

        String strPalabra = input.next();
        String answer = "Just a legend";
        int len = strPalabra.length();
        int SSinal = -1;
        int indice = 0;
        //int len = strPalabra.length() -1;
        //char[] palabra = strPalabra.toCharArray();
        boolean[] boolflag = new boolean[len + 1];
        int[] intSS = new int[len + 1];
        intSS[0] = -1;
        
        while (indice < len) {
            while (SSinal != -1 && strPalabra.charAt(SSinal) != strPalabra.charAt(indice)) {
                SSinal = intSS[SSinal];
            }
            intSS[++indice] = ++SSinal;
        }
        for (int i = 1; i < len; ++i) {
            boolflag[intSS[i]] = true;
        }
        int indiceAnswe = intSS[len];
        /*
         for (int i = 0; i < len; i++) {
         if (strPalabra.substring(0, i + 1).equals(strPalabra.substring(len - i, len + 1))) {
         if (strPalabra.substring(1, len).contains(strPalabra.substring(0, i + 1))) {
         answer = strPalabra.substring(0, i + 1);
         //System.out.println(answer);
         } else {
         break;
         }
         }
         //System.out.println(strPalabra.substring(0,i+1));
         //System.out.println(strPalabra.substring(palabra.length-i-1, palabra.length));
         }*/
        
        
        
        while (indiceAnswe != 0 && !boolflag[indiceAnswe]) {
            indiceAnswe = intSS[indiceAnswe];
        }
        if (indiceAnswe > 0) {
            //if (strPalabra.substring(1, len).contains(strPalabra.substring(0, i + 1))) {
         //answer = strPalabra.substring(0, i + 1);
         //System.out.println(answer);
         //}
            System.out.println(strPalabra.substring(0, indiceAnswe));
        } else {
            System.out.println(answer);
        }
        

        //System.out.println(answer);

    }
}