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

public class p14{

	static class FastReader{ 
		BufferedReader br; 
		StringTokenizer st; 

		public FastReader() 
		{ 
			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; 
		} 
	}

	static int [] createAux(char[] arr, int n){
		int[] aux = new int[n];
		int i=1, m=0;
		while(i<n){
			if(arr[i]==arr[m]){
				aux[i++] = ++m;
			} else if(arr[i] != arr[m] && m!=0){
				m = aux[m-1];
			} else{
				aux[i] = 0;
				i++;
			}
		}

		return aux;
	}

	public static void main(String[] args) 
	{ 
		FastReader sc = new FastReader();
		StringBuilder res = new StringBuilder();

		char[] arr = sc.nextLine().toCharArray();
		int n = arr.length;
		int[] aux = createAux(arr, n);

		int ans = 0;
		for(int i=n-2;i>=1;i--){
			if(i != ans-1)
				ans = Math.max(aux[i], ans);
		}
		ans = Math.min(ans, aux[n-1]);

		if(ans != aux[n-1]){
			if( aux[n-1]!=0 )
				ans = aux[aux[n-1]-1];
			else
				ans = 0;
		}
		
		if(ans==0){
			System.out.println("Just a legend");
			return;
		}

		for(int i=0;i<ans;i++)
			res.append(arr[i]);
		System.out.println(res);
	}
}

