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.Scanner;
 
public class Main {
     
    public static int[] getNext(String str){
        str = str + "#";
        char[] str_arr = str.toCharArray();
        int[] next = new int[str_arr.length];
        next[0] = -1;
        next[1] = 0;
        int i = 2;
        int cn = 0;
        while(i < str_arr.length){
            if(str_arr[i-1] == str_arr[cn]){
                next[i++] = ++cn;
            }else if(cn > 0){
                cn = next[cn];
            }else{
                next[i++] = 0;
            }
        }
        return next;
    }
 
    public static void main(String[] args) {
         Scanner sc = new Scanner(System.in);
         String str = sc.next();
         int[] next = getNext(str);
         int len = str.length();
         int[] hasMidLen = new int[len];
         next[0] = 0;
         for(int i = 0; i < len; ++i){
             hasMidLen[next[i]] = 1;
         }
         int j = len;
         boolean flag = false;
         while(next[j] != 0){
             if(hasMidLen[next[j]] == 1){
                 System.out.println(str.substring(0, next[j]));
                 flag = true;
                 break;
             }
             j = next[j];
         }
         if(!flag){
             System.out.println("Just a legend");
         }
    }
 
}