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
/******************************************************************************

                            Online Java Compiler.
                Code, Compile, Run an Debug java program online.
Write your code in this editor and press "Run" button to execute it.

*******************************************************************************/
import java.util.*;
 public class  Main 
{
    static int[] lcsgen(StringBuilder s)
    {
        int n=s.length();
        int[] lcs=new int[n];
        lcs[0]=0;
        int len=0,i=1;
        while(i<n)
        {
            if(s.charAt(i)==s.charAt(len))
            {
                len++;
                lcs[i]=len;
                i++;
            }
            else
            {
                if(len!=0)
                {
                    len=lcs[len-1];
                }
                else
                {
                    lcs[i]=0;
                    i++;
                }
            }
        }
        return lcs;
        
    }
    static void ans(StringBuilder s)
    {
        int[] lcs= lcsgen(s);
        int n=s.length();
        if(lcs[n-1]==0)
        {
        System.out.println("Just a legend");
        return;
        }
        for(int i=0;i<n-1;i++)
        {
            if(lcs[i]==lcs[n-1])
            {
                System.out.println(s.toString().substring(0,lcs[n-1]));
                return;
            }
        }
        if(lcs[lcs[n-1]-1]==0)
        {
            System.out.println("Just a legend");
        }
        else
        System.out.println(s.substring(0, lcs[lcs[n - 1] - 1])); 

    }
    public static void main(String[] args)
    {
        Scanner sc=new Scanner(System.in);
        StringBuilder s= new  StringBuilder(sc.next());
        ans(s);
    
    }
}
