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
// practice with kaiboy
import java.io.*;
import java.util.*;

public class CF127D extends PrintWriter {
	CF127D() { super(System.out, true); }
	Scanner sc = new Scanner(System.in);
	public static void main(String[] $) {
		CF127D o = new CF127D(); o.main(); o.flush();
	}

	void main() {
		byte[] cc = sc.next().getBytes();
		int n = cc.length;
		int[] zz = new int[n];
		for (int l = 0, r = 0, i = 1; i < n; i++)
			if (i + zz[i - l] < r)
				zz[i] = zz[i - l];
			else {
				l = i;
				if (r < l)
					r = l;
				while (r < n && cc[r] == cc[r - l])
					r++;
				zz[i] = r - l;
			}
		int z = 0;
		for (int i = 1; i < n; i++)
			if (z < zz[i])
				z = zz[i];
			else if (i + zz[i] == n) {
				println(new String(cc, 0, zz[i]));
				return;
			}
		println("Just a legend");
	}
}
