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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;

public class Main {
	public static final int MAX = 1000005;
	public static final int base = 131;
	public static long[] powers, hash;
	public static int N;
	public static String str;

	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		powers = new long[MAX + 1];
		powers[0] = 1;
		for (int i = 1; i <= MAX; i++) {
			powers[i] = (powers[i - 1] * base);
		}
		str = f.readLine();
		N = str.length();
		hash = new long[N];
		hash[0] = str.charAt(0) - 'a' + 1;
		for (int i = 1; i < N; i++) {
			hash[i] = (hash[i - 1] * base + str.charAt(i) - 'a' + 1);
		}
		ArrayList<Integer> list = new ArrayList<Integer>();
		for (int i = 0; i < N - 1; i++) {
			if (hash[i] == hash(N - 1 - i, N - 1)) {
				list.add(i);
			}
		}
		Collections.reverse(list);
		for (int i : list) {
			if (check(i)) {
				System.out.println(str.substring(0, i + 1));
				return;
			}
		}
		System.out.println("Just a legend");
	}

	public static boolean check(int n) {
		for (int i = 1; i + n < N - 1; i++) {
			if (hash(i, i + n) == hash[n]) {
				return true;
			}
		}
		return false;
	}

	public static long hash(int l, int r) {
		if (l == 0)
			return hash[r];
		return (hash[r] - hash[l - 1] * powers[r - l + 1]);
	}
}