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

public class CF126B {
	int[] zValues(char[] s) {
		int n = s.length, L = 0, R = 0;
		int[] z = new int[n];
		z[0] = n;
		for(int i = 1 ; i < n ; i++) {
			if(i > R) {
				L = R = i;
				while(R < n && s[R - L] == s[R]) R++;
				z[i] = R - L;
				R--;
			} else {
				int k = i - L;
				if(z[k] < R - i + 1) {
					z[i] = z[k];
				} else {
					L = i;
					while(R < n && s[R - L] == s[R]) R++;
					z[i] = R - L;
					R--;
				}
			}
		}
		return z;
	}
	public CF126B() {
		System.err.println("Go!");
		FS scan = new FS();
		PrintWriter out = new PrintWriter(System.out);
		char[] s = scan.next().toCharArray();
		int n = s.length;
		int[] z = zValues(s);
		TreeSet<Integer> zvals = new TreeSet<>();
		int ind = -1;
		for(int i = 1 ; i < n ; i++) {
			if(z[i] == n - i) {
				if(zvals.ceiling(z[i]) != null) {
					ind = i;
					break;
				}
			}
			zvals.add(z[i]);
		}
		if(ind != -1) {
			StringBuilder sb = new StringBuilder();
			for(int i = ind ; i < n ; i++)
				sb.append(s[i]);
			out.println(sb);
		} else {
			out.println("Just a legend");
		}
		out.close();
	}
	class FS {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer("");
		public String next() {
			while(!st.hasMoreTokens()) {
				try { st = new StringTokenizer(br.readLine()); }
				catch(Exception e) { e.printStackTrace(); }
			}
			return st.nextToken();
		}
		public int nextInt() { return Integer.parseInt(next()); }
	}
	public static void main(String[] args) { new CF126B(); } 
}