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
// Yaru ro bordan Class mige Tshirtam take !!
import java.util.*;

public class Password {
	static int n, p[];
	
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		String ss = in.next();
		char[] s = ss.toCharArray();
		
		n = s.length;
		p = new int[n];
		for (int i = 1, j = 0; i < n; i++) {
			while (j > 0 && s[i] != s[j])
				j = p[j - 1];
			if (s[i] == s[j])
				++j;
			p[i] = j;
		}
		
		boolean[] mark = new boolean[n + 2];
		for (int i = p.length - 2; i >= 0; i--)
			mark[p[i]] = true;
		int tmp = p[n - 1];
		int ans = 0;
		while (tmp != 0) {
			if (mark[tmp]) {
				ans  = tmp;
				break;
			}
			tmp = p[tmp - 1];
		}
		if (tmp > 0)
			System.out.println(ss.substring(0, ans));
		else
			System.out.println("Just a legend\n");	
	}

}
