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.Arrays;
import java.util.Scanner;

public class Z_Password {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        
        String str = s.next();
        int z[]=z_function(str.toCharArray());
//      System.out.println(Arrays.toString(z));
        int n = z.length;
        int best = 0;
        for (int i = 2; i < n; i++) {
            int post = z[i];
            if(post>=best)
            if(i+post == n){// ==> suffix e
                for (int j = 1; j < i; j++) {
                    if(z[j]>=post){
                        if(post>best){
                            best=post;
                        }
                    }
                }
            }
            
        }
        
        
        if(best==0){
            System.out.println("Just a legend");
        }
        else System.out.println(str.substring(0,best));
        
    }

    public static int []z_function(char []s){
        int n = s.length;
        int z[] = new int[n];
        int left = 0,right = 0;
        for (int i = 1; i < z.length; i++) {
            if(i<=right)
                z[i] = Math.min(right - i + 1, z[i-left]);
            while(i+z[i]<n && s[i+z[i]]==s[z[i]])
                z[i]++;
            if(i+z[i] -1>right){
                left = i;
                right = i+z[i]-1;
            }
        }
        
        return z;
    }
}