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

// 08.02.2012 17:25:02
// D93 by Resurgent

public class D93 {

	long[] hash, p;
	final long prime = 1000000 + 3;

	private void Solution() throws IOException {
		String s = nextToken();
		makeHash(s);
		ArrayList<Integer> len = new ArrayList<Integer>();
		for (int i = 1; i < s.length() - 1; i++)
			if (hashAt(1, i) == hashAt(s.length() - i + 1, s.length()))
				len.add(i);
		Collections.reverse(len);
		for (int l : len) {
			long cur = hashAt(1, l);
			for (int i = 2; i <= s.length() - l; i++)
				if (cur == hashAt(i, i + l - 1)) {
					print(s.substring(0, l));
					return;
				}
		}
		print("Just a legend");
	}

	void makeHash(String s) {
		long cur = 0;
		hash = new long[s.length() + 1];
		p = new long[s.length() + 1];
		p[0] = 1;
		for (int i = 0; i < s.length(); i++) {
			cur *= prime;
			cur += s.charAt(i);
			hash[i + 1] = cur;
			p[i + 1] = p[i] * prime;
		}
	}

	long hashAt(int i, int j) {
		return hash[j] - hash[i - 1] * p[j - i + 1];
	}

	public static void main(String[] args) {
		new D93().run();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tokenizer;

	public void run() {
		try {
			String file = "";
			file = "system";
			if (file.equals("system")) {
				in = new BufferedReader(new InputStreamReader(System.in));
				out = new PrintWriter(System.out);
			} else if (file.equals("")) {
				in = new BufferedReader(new FileReader(new File("input.txt")));
				out = new PrintWriter(new File("output.txt"));
			} else {
				in = new BufferedReader(new FileReader(new File(file + ".in")));
				out = new PrintWriter(new File(file + ".out"));
			}
			tokenizer = null;
			Solution();
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(0);
		}
	}

	void print(Object... o) {
		for (int i = 0; i < o.length; i++) {
			if (i != 0)
				out.print(" ");
			out.print(o[i]);
		}
	}

	void println(Object... o) {
		for (int i = 0; i < o.length; i++) {
			if (i != 0)
				out.print(" ");
			out.print(o[i]);
		}
		out.println();
	}

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

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

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

	String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(in.readLine());
		return tokenizer.nextToken();
	}
}
