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:
//package perm_hermosa;

import java.util.ArrayList;
import java.util.Scanner;
 
public class pass {

    static ArrayList<Integer> cadenaPrefijo = new ArrayList();
 
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String cadena = sc.next();
        int tamCad = cadena.length()-1;
        
        calcular(cadena);
        
        boolean verdad = false;
        int tam;
 
        tam = cadenaPrefijo.get(tamCad);
 
        if(tam!=0){
            for(int j=0;j<2;j++){
                for (int i=1; i<tamCad; i++) {
                    if (cadenaPrefijo.get(i) == tam) {
                        verdad = true;
                        break;
                    }
                }
                if(!verdad){
                    tam = cadenaPrefijo.get(tam-1);
                    if(tam==0) break;
                }
                else break;
            }
        }
        if (!verdad || tam == 0) System.out.println("Just a legend"); //debe aceptar esa cadena
        else System.out.println(cadena.substring(0, tam));
    }
 
    public static void calcular(String cadena) {
        cadenaPrefijo.add(0);
        int tam = cadena.length();
        for (int i=1,j=0; i<tam; i++) {
            while (j>0 && cadena.charAt(j) != cadena.charAt(i))
                j = cadenaPrefijo.get(j-1);
            if (cadena.charAt(j) == cadena.charAt(i))
                cadenaPrefijo.add(i,++j);
            else
                cadenaPrefijo.add(i,j);
        }
    }
 
}