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

public class Main{

    BufferedReader in;
    StringTokenizer str = null;
    PrintWriter out;

    private String next() throws Exception{
    	if (str == null || !str.hasMoreElements())
    	    str = new StringTokenizer(in.readLine());
    	return str.nextToken();
    }
    
    private int nextInt() throws Exception{
	   return Integer.parseInt(next());
    }

    char []a;
    long []hash, pow;
    final long PRIME = 37;
    
    public void run() throws Exception{
    	in = new BufferedReader(new InputStreamReader(System.in));
    	out = new PrintWriter(System.out);

    	a = next().toCharArray();
    	int n = a.length;
    	pow = new long[n];
    	pow[0] = 1;
    	for(int i=1;i<n;i++){
    		pow[i] = pow[i-1] * PRIME;
    	}

    	hash = new long[n];
    	for(int i=0;i<n;i++){
    		hash[i] = (a[i] - 'a' + 1) * pow[i];
    		if (i > 0) hash[i]+=hash[i-1];
    	}

    	for(int len=n-1;len>0;len--){
    		long prefix = hash[len-1];
    		long suffix = hash[n-1] - hash[n-1-len];
    		if (prefix * pow[n-len] == suffix) {
    			for(int i=1;i<n-len;i++){
    				long h = hash[i + len - 1] - hash[i-1];
    				if (prefix * pow[i] == h) {
    					for(int j=0;j<len;j++){
    						out.print(a[j]);
    					}
    					out.println();
    					out.close();
    					return;
    				}
    			}
    		}
    	}
    	out.println("Just a legend");
		out.close();	
    }

    public static void main(String args[]) throws Exception{
	   new Main().run();
    }
}