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

public class first{
	public static void main(String ... args){
		Scanner in = new Scanner(System.in);

		String s = in.nextLine();
		int n = s.length();
		int[] p = new int[n+1];
		for(int i =2;i<=n;i++){
			int parent = p[i-1];
			while(true){
				if(s.charAt(parent)==s.charAt(i-1)){
					p[i]=1 + parent;
					break;
				}else if(parent!=0){
					parent = p[parent];
				}else{
					break;
				}
			}
		}
		boolean[] ok = new boolean[n];
		int index = n;
		while(index != 0){
			index =p[index];
			ok[index]=true;
		}
		int[] dp = new int[n];
		int ret =0;
		for(int i = 2;i<dp.length;i++){
			int prev = p[i];
			if(ok[prev])
				ret = Math.max(ret, prev);
			ret = Math.max(ret, dp[prev]);
		}
		System.out.println(ret==0 ? "Just a legend" : s.substring(0,ret));
	}
}