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 A {
	public static void main(String[] args)throws Throwable {
		MyScanner sc=new MyScanner();
		PrintWriter pw=new PrintWriter(System.out);
		
		String s=sc.next();
		compute_z(s.toCharArray());
//		System.out.println(Arrays.toString(z));
		int [] max=new int [n];
		max[0]=z[0];
		for(int i=1;i<n;i++)
			max[i]=Math.max(max[i-1], z[i]);
		int ans=0;
		for(int i=n-1;i>0;i--){
			if(z[i]==n-i && max[i-1]>=z[i])
				ans=z[i];
		}
		if(ans==0)
			pw.println("Just a legend");
		else
			pw.println(s.substring(0, ans));
		
		
		pw.flush();
		pw.close();
	}
	
	static int n;
	static int [] z;
	
	static void compute_z(char [] s){
		n=s.length;
		z=new int [n];
		int l=0,r=0,k=0;
		
		for(int i=1;i<n;i++){
			if(i>r){
				l=r=i;
				while(r<n && s[r-l]==s[r])
					r++;
				z[i]=r-l;
				r--;
			}else{
				k=i-l;
				if(z[k]<r-i+1)
					z[i]=z[k];
				else{
					l=i;
					while(r<n && s[r-l]==s[r])
						r++;
					z[i]=r-l;
					r--;
				}				
			}
		}
	}
	
	static class MyScanner {
		BufferedReader br;
		StringTokenizer st;
		public MyScanner() {
			try {
				br = new BufferedReader(new FileReader(new File("boring.in")));
			} catch (FileNotFoundException e) {
				br = new BufferedReader(new InputStreamReader(System.in));
			}
			}
		String next() {while (st == null || !st.hasMoreElements()) {
			try {st = new StringTokenizer(br.readLine());}
			catch (IOException e) {e.printStackTrace();}}
		return st.nextToken();}
		int nextInt() {return Integer.parseInt(next());}
		long nextLong() {return Long.parseLong(next());}
		double nextDouble() {return Double.parseDouble(next());}
		String nextLine(){String str = "";
		try {str = br.readLine();}
		catch (IOException e) {e.printStackTrace();}
		return str;}
	}
}