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.*;
import java.math.*;
import java.util.*;
/*public class TaskB {

}
 */
public class TaskB implements Runnable {
	// based on Petr's template
	int[] next;
	
	private void solve() throws IOException {
		String str = this.nextToken() + " ";
		next = new int[ str.length() + 2 ];
		getnext( str );
		int n = str.length() - 1;
		int ret = next[n];
//		for ( int i = 0; i <= n; i ++ )	System.out.print( next[i] + " " );	System.out.println();
		if ( ret == 0 ){
			writer.println( "Just a legend" );
			return;
		}
		for ( int i = 0; i < n; i ++ )
			if ( next[i] >= ret ){
				writer.println( str.substring( 0, ret ) );
				return;
			}
		ret = next[ ret ];
		if ( ret <= 0 )
			writer.println( "Just a legend" );
		else
			writer.println( str.substring( 0, ret ) );
	}
	
	void getnext( String str ){
	    int i = -1, j = 0;
	    int len = str.length() - 1;
	    next[0] = -1;
	    
	    while( j <= len ){
	        if ( i == -1 || str.charAt(i) == str.charAt(j) ){
	            i ++;
	            j ++;
	            next[j] = i;
	        }
	        else
	            i = next[i];
	    }
	}

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

	BufferedReader reader;
	StringTokenizer tokenizer;
	PrintWriter writer;

	public void run() {
		try {
			reader = new BufferedReader(new InputStreamReader(System.in));
			writer = new PrintWriter(new OutputStreamWriter(System.out));
			tokenizer = null;
			solve();
			reader.close();
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(1);
		}
	}

	boolean hasNext() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			String nextLine = reader.readLine();
			if (nextLine == null)
				return false;
			tokenizer = new StringTokenizer(nextLine);
		}

		return true;
	}

	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 nextLine() throws IOException {
		return reader.readLine();
	}

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

		return tokenizer.nextToken();
	}

	BigInteger nextBigInteger() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			tokenizer = new StringTokenizer(reader.readLine());
		}

		return new BigInteger(tokenizer.nextToken());
	}
}