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.util.Arrays;
import java.util.Scanner;


public class D93 {

	
	
	public void run() {
		try {
			Scanner in = new Scanner(System.in);
			String p = in.next();
			

			
			
			char[] a = (" " + p).toCharArray();
			int[] pi = new int[a.length];
			
			int k = 0;
			for (int q = 2; q < pi.length; q++) {
				while (k > 0 && a[k+1] != a[q]) k = pi[k];
				if (a[k+1] == a[q]) k++;
				pi[q] = k;
			}
			
			
			int sz = a.length-1;
			int pp = pi[a.length-1];
			if (pi[pi.length-1] == 0) {
				System.out.println("Just a legend");
			} else {
				int x = pi[pi.length-1];
				boolean found = false;
				while (!found) {
					for (int i = x; !found && i < pi.length; i++) {
						if (pi[i] == x && i != pi.length-1){
							found = true;
						}
					}
					if (!found) {
						x = pi[x];
					}
					if (x == 0) {
						break;
					}
				}
				if (found) {
					System.out.println(p.substring(0, x));
				} else {
					System.out.println("Just a legend");
				}
			}
			
			
			
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	public static void main(String[] args) {
		new D93().run();
	}
}