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

public class Main implements Runnable {

	public void _main() throws IOException {
		char[] s = next().toCharArray();
		int n = s.length;
		h = new long[n];	
		pow = new long[n + 1];
		Random random = new Random(this.hashCode());
		P = random.nextInt(1000000) + 1000000;
		while (!BigInteger.valueOf(P).isProbablePrime(50)) ++P;
		pow[0] = 1;
		h[0] = s[0];
		for (int i = 1; i <= n; i++) {
			if (i < n) {
				h[i]  = P * h[i - 1]  + s[i]; 
			}
			pow[i] = pow[i - 1] * P;
		}
		
		boolean[] good = new boolean[n + 1];
		for (int i = 1; i <= n; i++)
			if (hash(0, i) == hash(n - i, i))
				good[i] = true;
		int l = 0;
		int r = n + 1;
		while (r - l > 1) {
			int m = (l + r) / 2;
			long need = hash(0, m);
			boolean ok = false;
			for (int i = 1; i + m < n; i++)
				if (hash(i, m) == need) {
					ok = true;
					break;
				}
			if (ok)
				l = m;
			else
				r = m;
		}

		int len = l;
		while (len > 0) {
			if (good[len])
				break;
			--len;
		}

		if (len == 0) {
			out.println("Just a legend");
		} else {
			for (int i = 0; i < len; i++)
				out.print(s[i]);
			out.println();
		}
	}
	
	long[] pow;
	long[] h;
	long P;

	private long hash(int pos, int len) {
		if (pos == 0)
			return h[len - 1];
		return h[pos + len - 1] - pow[len] * h[pos - 1];
	}

	private BufferedReader in;
	private PrintWriter out;
	private StringTokenizer st;

	private String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String rl = in.readLine();
			if (rl == null)
				return null;
			st = new StringTokenizer(rl);
		}
		return st.nextToken();
	}

	private int nextInt() throws IOException {
		return Integer.parseInt(next());
	}

	private long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	private double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	public static void main(String[] args) {
		Locale.setDefault(Locale.UK);
		new Thread(new Main()).start();
	}

	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);

			_main();

			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(202);
		}
	}

}