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.io.PrintWriter;
import java.util.*;


public class B {
	static BufferedReader bf = new BufferedReader(new InputStreamReader(
			System.in));
	static StringTokenizer st;
	static PrintWriter out = new PrintWriter(System.out);

	static String nextToken() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String s = bf.readLine();
			if (s == null)
				return null;
			st = new StringTokenizer(s);
		}

		return st.nextToken();
	}

	static int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	static long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	static String nextStr() throws IOException {
		return nextToken();
	}

	static double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}

	public static void main(String[] args) throws IOException {
		String t = nextStr();
		byte s[] = t.getBytes();
		int n = s.length;
		int p[] = new int[n];
		
		if (n <= 2) {
			out.println("Just a legend");
			out.flush();
			return;
		}
		
		HashSet<Integer> set = new HashSet<Integer>();
		
		for (int i = 1; i < n - 1; i++) {
			int j = p[i - 1];
			while (j > 0 && s[i] != s[j]) {
				j = p[j - 1];
			}
			
			if (s[i] == s[j]) {
				j++;
			}
			
			p[i] = j;
			set.add(j);
		}
		
		int j = p[n - 2];
		while (j > 0) {
			if (s[n - 1] == s[j] && set.contains(j + 1)) {
				out.println(t.substring(0, j + 1));
				out.flush();
				return;
			}
			j = p[j - 1];
		}
		
		if (s[0] == s[n - 1]) {
			for (int i = 1; i < n - 1; i++) {
				if (s[i] == s[0]) {
					out.println(t.substring(0, 1));
					out.flush();
					return;
				}
			}
		}
		
		out.println("Just a legend");
		out.flush();
		
	}
}