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.io.*;
import java.util.*;

public class Zalgorithm {

    public static void main(String args[]) throws IOException{

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        String s = br.readLine();
            int z[] = Z_function(s);
            int n= z.length;


                int ans = -1;
                int candidate = -1;
                boolean mila = false;
                int start = -1;

//                    for(int e : z){
//                        System.out.print(e+" ");
//                    }
//        System.out.println();

                        for(int i = n-1; i>=0; i--){
                            if(z[i]==n-i){
                                candidate = z[i];
                                start = i-1;
                                break;
                            }
                        }

                            if(candidate==-1){
                                System.out.println("Just a legend");
                            }
                            else{
                                for(int i= start; i>=0; i--){
                                    if(z[i]==n-i){
                                        ans =candidate;
                                        candidate = z[i];
                                    }
                                    else if(z[i]>=candidate){
                                        ans = candidate;
                                    }
                                }

                                if(ans==-1){
                                    System.out.println("Just a legend");
                                }
                                else {
                                    System.out.println(s.substring(0, ans ));
                                }
                            }
    }

    static int[] Z_function(String s){

        int z[] = new int[s.length()];
            int n = s.length();

            z[0] = 0;

            int l = 0;
            int r = 0;

                for(int i = 1; i<n; i++){

                    if(i<=r){
                        z[i] = Math.min(z[i-l],r-i+1);
                    }
                    while(i + z[i]<n && s.charAt(z[i])==s.charAt(i+z[i])){
                        z[i]++;
                    }
                    if(i+z[i]-1>r){
                        l = i;
                        r = i + z[i] -1;
                    }
                }

                return z;
    }
}