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

public class D_D1 {
	
	static final int MOD = 13498193;
	
	int n;
	String s;
	
	int[] next = new int[1000101];
	int[] b = new int[1000101];
	int[] d = new int[1000101];
	int[] c = new int[1000101];
	
	public void solve() throws IOException {
		s = reader.readLine();
		n = s.length();
		initHash();
		/*for (int i = 0; i < n; i++) 
			System.out.print(d[i] + " ");
		System.out.println();
		for (int i = 0; i < n; i++)
			System.out.print(c[i] + " ");
		System.out.println();*/
		kmp();
		Integer[] pos = new Integer[1000101];
		int cnt = 0;
		for (int i = 2; i < n; i++)
			pos[cnt++] = next[i];
		Arrays.sort(pos, 0, cnt, Collections.reverseOrder());
		int kq = 0;
		for (int i = 0; i < cnt; i++) 
			if (pos[i] > 0 && ok(pos[i])) {
				kq = pos[i];
				break;
			}
		if (kq == 0) writer.println("Just a legend");
		else writer.println(s.substring(0, kq));
	}
	
	final private void initHash() {
		d[0] = s.charAt(0) - 'a';
		for (int i = 1; i < n; i++)
			d[i] = (d[i - 1] * 26 + (s.charAt(i) - 'a')) % MOD;
		c[n - 1] = s.charAt(n - 1) - 'a';
		int base = 1;
		for (int i = n - 2; i >= 0; i--) {
			base = (base * 26) % MOD;
			c[i] = ((s.charAt(i) - 'a') * base + c[i + 1]) % MOD;
		}
	}
	
	final private void kmp() {
		int j = -1;
		next[0] = -1;
		for (int i = 0; i < n; i++) {
			while (j != -1 && s.charAt(i) != s.charAt(j)) 
				j = next[j];
			j++;
			next[i + 1] = j;
		}
	}
	
	final private boolean ok(int x) {
		return d[x - 1] == c[n - x];
	}

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

	BufferedReader reader;
	StringTokenizer tokenizer;
	PrintWriter writer;

	public void run() {
		try {
			long tbegin = System.currentTimeMillis();
			reader = new BufferedReader(new InputStreamReader(System.in));
			//reader = new BufferedReader(new InputStreamReader(new FileInputStream("fselect.inp")));
			tokenizer = null;
			writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(
					System.out)));
			//writer = new PrintWriter(new FileOutputStream("fselect.out"));
			solve();
			//System.out.println(System.currentTimeMillis() - tbegin + "ms...");
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

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

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

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

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

}
