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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;

public class Round93div1B {

	public static void KMP_Process(String str,int[] reset_table) {
		int m=str.length();
		int i=0,j=-1;
		reset_table[i]=j;
		while(i<m) {
			while(j>=0 && str.charAt(i)!=str.charAt(j)) {
				j=reset_table[j];
			}
			i++; j++;
			reset_table[i]=j;
		}
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		out=new PrintWriter (new BufferedOutputStream(System.out));
		FastReader s=new FastReader();
		String str=s.next();
		int[] arr=new int[str.length()+1];
		KMP_Process(str,arr);
		if(arr[arr.length-1]==0) {
			out.println("Just a legend");
			out.close();
			return;
		}
		HashMap<Integer,Integer> helper=new HashMap<>();
		for(int i=0;i<arr.length;i++) {
			helper.put(arr[i], helper.containsKey(arr[i])?helper.get(arr[i])+1:1);
		}
		if(helper.get(arr[arr.length-1])>=2) {
			for(int i=0;i<arr[arr.length-1];i++) {
				out.print(str.charAt(i));
			}
			out.close();
			return;
		}
		if(arr[arr[arr.length-1]]==0) {
			out.println("Just a legend");
			out.close();
			return;
		}
		int ans=arr[arr[arr.length-1]];
		for(int i=0;i<ans;i++) {
			out.print(str.charAt(i));
		}
		out.close();
	}

	public static PrintWriter out;
	
	public static class FastReader {
		BufferedReader br;
		StringTokenizer st;
		//it reads the data about the specified point and divide the data about it ,it is quite fast
		//than using direct 

		public FastReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
			//InputStream reads the data and decodes in character stream
			//It acts as bridge between byte stream and character stream
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (Exception e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(next());//converts string to integer
		}

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

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

		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (Exception e) {
				e.printStackTrace();
			}
			return str;
		}
	}
	
}