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.*; 
import java.math.*;
import java.io.*;
 import java.text.DecimalFormat;
public class Main{
    static int[] arr;
    static String h;
    public static void main(String[] args)  throws IOException {
        s.init(System.in);        
        String a=s.next();
        char[] b=a.toCharArray();
        int[] z=zFunction(b);
        int n=a.length();
        int max[]=new int[n];
        for(int i=1;i<n;i++){
            max[i]=Math.max(max[i-1],z[i]);
        }
        int ans=0;
        for(int i=1;i<n;i++){
            if((i+z[i]==n)&&(max[i-1]>=z[i]))
                ans=Math.max(ans,z[i]);
        }
        if(ans==0)
            System.out.println("Just a legend");
        else
            System.out.println(a.substring(0,ans));
        
    }
    public static int[] zFunction(char pat[]){
        int n = pat.length;
        int z[] = new int[n];
        
        int l = 0,r = 0;
        for(int i=1;i<n;i++){
            if(i > r){
                l = r = i;
                while(r < n && pat[r-l] == pat[r]) r++;
                z[i] = r - l;
                r--;
            }
            else{
                int k = i - l;
                if(z[k] < r - i + 1)    z[i] = z[k];
                else{
                    l = i;
                    while(r < n && pat[r-l] == pat[r]) r++;
                    z[i] = r - l;
                    r--;
                }
            }
        }
        
        //z[0] = 0 , n;
        return z;
    }
        
    public static int gcd(int a,int b){
        if(a%b==0)
            return b;
        else
            return gcd(b,a%b);
        
    }

    public static int pow(int x,int y){
        int ans=1;
        while(y>0){
            if(y%2==1)
                ans*=x;
            x*=x;
            
            
            y/=2;
            
        }
        return ans;
    }   
    public static class s {
        static BufferedReader reader;
        static StringTokenizer tokenizer;
 
        /** call this method to initialize reader for InputStream */
        static void init(InputStream input) {
            reader = new BufferedReader(
                        new InputStreamReader(input) );
            tokenizer = new StringTokenizer("");
        }   
 
        /** get next word */
        static String next() throws IOException {
            while ( ! tokenizer.hasMoreTokens() ) {
                //TODO add check for eof if necessary
                tokenizer = new StringTokenizer(
                    reader.readLine() );
            }
            return tokenizer.nextToken();
        }
 
        static int nextInt() throws IOException {
            return Integer.parseInt( next() );
        }
    
        static double nextDouble() throws IOException {
            return Double.parseDouble( next() );
        }
        static long nextLong() throws IOException {
            return Long.parseLong( next() );
        }
        
    }
}