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

public class N126B {
	static PrintWriter out;
	static Scanner sc;
	public static void main(String[] args) throws IOException {
		sc=new Scanner(System.in);
		out=new PrintWriter(System.out);
		String s=sc.next();
		int n=s.length();
		int[]pi=kmp(s.toCharArray());
		if(pi[n-1]==0) {
			out.println("Just a legend");
			out.close();
			return;
		}
		int cur=0;
		for(int i=1;i<n-1;i++) {
			if(pi[i]==pi[n-1]) {
				out.println(s.substring(0,pi[n-1]));out.close();return;
			}
		}
		if(pi[pi[n-1]-1]==0) {
			out.println("Just a legend");
		}else {
			out.println(s.substring(0,pi[pi[n-1]-1]));out.close();return;

		}
		
		out.close();
	}
	
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public boolean hasNext() {return st.hasMoreTokens();}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		
		public double nextDouble() throws IOException {return Double.parseDouble(next());}
		
		public long nextLong() throws IOException {return Long.parseLong(next());}

		public String nextLine() throws IOException {return br.readLine();}
			
		public boolean ready() throws IOException {return br.ready(); }
		

	}
	private static int[] kmp(char[]c) {//amortized O(N)
		int[]pi=new int[c.length];
		for(int i=1;i<pi.length;i++) {
			int j=pi[i-1];
			while(j>0&&c[i]!=c[j])j=pi[j-1];
			if(c[i]==c[j])j++;
			pi[i]=j;
		}
		return pi;
	}
}