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


public class Task126B {
	
	
	
	public static void solve() throws IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));		
		String str = in.readLine();
		char[] cStr = str.toCharArray();
		int n = cStr.length;
		int[] z = new int[n];
		int[] h = new int[1000010];
		int l = 0, r = 0;
		int maxl = 0;	
		
			
			for (int i = 1; i < n; i++) {
				
				if(i <= r){
					z[i] = Math.min(z[i-l], r-i+1);
				}
				
				while(i+z[i] < n && cStr[z[i]] == cStr[i+z[i]]) 
					++z[i];
				
				if(z[i] == n-i) {
					h[z[i]] = 1;
				
				}
				
				if(i+z[i]-1 > r) {
					l = i;
					r = i+z[i]-1;
				}
				
				
			}
			
			for (int i = 0; i < n; i++) {
				if(maxl < Math.min(z[i],n-i-1)) {
					maxl = Math.min(z[i],n-i-1);
				}
			}
				
			for (int i = n-1; i >= 1; i--) {
				if(h[i] == 1 && i <= maxl) {
					System.out.println(str.substring(0,i));
					System.exit(0);
				}
			}
			
			System.out.println("Just a legend");
			
		
	}
	public static void main(String[] args) throws IOException {
		solve();

	}

}