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:
/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */
import java.util.*;
/**
 *
 * @author arvin
 */
public class Password {
    
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        String s=sc.nextLine();
        
        if(s.length()<=2)
        {
            System.out.println("Just a legend");
            return;
        }
        int i=1,len=0;
        int a[]=new int[s.length()];
        a[0]=0;
        while(i<s.length())
        {
            if(s.charAt(i)==s.charAt(len))
            {
                len++;
                a[i]=len;
                i++;
            }
            else
            {
                if(len!=0)
                    len=a[len-1];
                else
                {
                    a[i]=0;
                    i++;
                }
            }
        }
        int ch=a[s.length()-1];
        if(ch==0)
        {
            System.out.println("Just a legend");
            return;
        } 
        //System.out.println(ch+" "+a[4]);
        boolean x=false;
        i=ch;
        while(true)
        {
            if(i>=ch && i<s.length()-1)
            {
                if(a[i]==ch)
                {
                    x=true;
                    break;
                }
                else
                    i++;
            }
            else
            {
                ch=a[ch-1];
                i=ch;
                if(ch==0)
                {
                    x=false;
                    break;
                }
            }
        }
        if(x)
            System.out.println(s.substring(0,ch));
        else
            System.out.println("Just a legend ");
        
    }
    
}