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.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;

public class Main {
	static StringBuffer sb = new StringBuffer();
	public static void main(String[] args) throws IOException {
//		FileInputStream file = new FileInputStream("C:\\Users\\User\\AFC_Comp\\Password\\src\\teste.txt");
//		BufferedReader r = new BufferedReader(new InputStreamReader(file));
		BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
		
		int stringLength = 0;
		char a;
		char[] charArray = new char[10000001];
		while((a = (char)r.read()) != '\n' && a != '\r') {
			charArray[stringLength] = a;
			stringLength++;
		}
		boolean done = false;
//		long startTime = System.nanoTime();
		int[] lps = buildLps(charArray, 0, stringLength);
		for(int i = Math.min(lps[stringLength - 1], stringLength - 2); i >= 1 && !done; i--) {
			sb = new StringBuffer();
			if(compare(charArray, 0, i, stringLength - i, stringLength)) {
				done = compareAgain(charArray,lps, 0, i, 1, stringLength > 2 ? stringLength - 2 : 1);
			}
		}
		
		if(!done) {
			System.out.println("Just a legend");
		} else {
			System.out.println(sb);
		}

//		long stopTime = System.nanoTime();
//		System.out.println((stopTime - startTime) / 1000000);
	}
	static int[] buildLps(char[] arr, int i1, int j1) {
		int[] ret = new int[j1 - i1];
		int j = 0;
		ret[j] = 0;
		for(int i = 1; i < j1; i++) {
			if(arr[i] == arr[j]) {
				ret[i] = j + 1;
				j++;
			} else {
				if(j == 0) {
					ret[i] = 0;
				} else {
					j = ret[j - 1];
					i--;
				}
			}
		}
		
		return ret;
	}
	
	static boolean compareAgain(char[] arr,int[] lps, int i1, int j1, int i2, int j2) {
		int recorder = 0;
		for(int i = i2; i <= j2; i++) {
			if(recorder >= j1 - i1) {
				return true;
			}
			if(arr[i] == arr[i1 + recorder]) {
				recorder++;
			} else {
				if(recorder != 0) {
					i--;
					recorder = lps[recorder - 1];
				}
			}
		}
		return recorder >= j1 - i1;
	}
	static boolean compare(char[] arr, int i1, int j1, int i2, int j2) {
		for(int i = 0; i < j1 - i1; i++) {
			if(arr[i1 + i] != arr[i2 + i]) {
				sb = new StringBuffer();
				return false;
			}
			sb.append(arr[i1 + i]);
		}
		return true;
	}
}

  		  			 	 	 	 		 			  	 		