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.IOException;
import java.io.InputStreamReader;

public class Pswd {
    static long b = 33;
    static long[] pb;
    static String s;
    static long[] hash;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        s = br.readLine();
        int n = s.length();
        if(n<3){
            System.out.println("Just a legend");
            return;
        }
        rh();
        pb = new long[n + 1];
        pb[0] = 1;
        for (int i = 1; i <= n; i++) {
            pb[i] = pb[i-1]*b;
        }
        int[] lens = new int[n];
        int max = 0;
        int min = 0;
        for (int i = 1; i < n; i++) {
            if(preAndSu(i)){
                lens[max++] = i;
            }
        }
        max--;
        int mid=0;
        while(min<max){
            mid = min + (max-min +1)/2;
            if(!isSub(lens[mid])){
                max = mid -1;
            }
            else{
                min = mid;
            }
        }
        String ret = max>-1&&isSub(lens[min])?s.substring(0,lens[min]):"Just a legend";
        System.out.println(ret);

    }
    static boolean isSub(int l){
        int last = s.length() - l;
        boolean ret = false;
        for (int i = 1; i < last; i++) {
            ret = subs(0, l-1) == subs(i,l+i-1);
            if(ret)break;
        }
        return ret;
    }
    static boolean preAndSu(int l){
        return subs(0, l-1) == subs(s.length()-l, s.length()-1);
    }
    static void rh(){
        int n = s.length();
        hash = new long[n+1];
        hash[n-1] = (long)s.charAt(n-1);
        for (int i = n-2; i>-1; i--) {
            hash[i] = (long)s.charAt(i)+hash[i+1]*b;
        }
    }
    
    static long subs(int i, int j){
        return hash[i] - hash[j+1]*pb[j+1-i];
    }
}