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

public class Main
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner s=new Scanner(System.in);
			String p=s.next();
		    s.skip("(\r\n|[\n\r\u2028\u2029\u0085])?"); 
// 			System.out.println(p);
			ArrayList<Integer> lps=new ArrayList<Integer>();
			lps.add(0);
			HashSet<Integer> hs=new HashSet<>();
			for(int i=1;i<p.length();i++)
			{
				int j=lps.get(lps.size()-1);
				while(j>0 && p.charAt(j)!=p.charAt(i))
				{
					j=lps.get(j-1);
				}
				if(p.charAt(j)==p.charAt(i)) j++;
				lps.add(j);
				if(i!=(p.length()-1))
				hs.add(j);
			}
			int j=lps.get(p.length()-1);
			boolean flag=false;
			while(j>0)
			{
			    if(hs.contains(j))
			    {flag=true;break;}
			    j=lps.get(j-1);
			}
			if(!flag)
			System.out.println("Just a legend");
			else System.out.println(p.substring(0,j));
		}
	
}