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 C {
    public static int test(String line) {
        long beginHash[] = new long[line.length()];
        long endHash[]  = new long[line.length()];
        long pow[] = new long[line.length()];
        long mod = 10000007L;
        beginHash[0]= line.charAt(0);
        pow[0] =1;
        endHash[line.length() - 1] = line.charAt(line.length() - 1);
        int ans = 0;
        for (int i = 1; i < line.length() - 1; i ++) {
            pow[i] = pow[i -1] * 256%mod;
            int k = line.length() - i - 1;
            beginHash[i] = beginHash[i-1] * 256 + line.charAt(i);
            endHash[k] = endHash[k+1] +  line.charAt(k) * pow[i];
            beginHash[i] = (beginHash[i] % mod + mod ) % mod;
            endHash[k] = (endHash[k] % mod + mod) % mod;
            
        }
        for (int i = line.length() - 2; i >= 0; i --) {
            
            if (beginHash[i] == endHash[line.length() - i - 1]) {
//                System.out.println("in : " + i);
                long hash = beginHash[i];
                
                
                for (int j = 1; j + i <line.length() -1 ; j ++) {
                    hash = hash - line.charAt(j-1)*pow[i];
                    hash = hash * 256 + line.charAt(j + i );
                    hash = (hash % mod + mod) % mod;
                    
                    if (hash == beginHash[i]) {
                        int k;
                        for (k = 0 ; k <= i ; k ++) {
                            if (line.charAt(k) != line.charAt(j + k)) break; 
                            if (line.charAt(k) != line.charAt(line.length()  - i - 1 + k )) break;
                        }
                        if (k== i + 1) {
                            ans = i + 1;
                            return ans;
                        }
                    }
                }
            }
             
        }
        return ans;
            
    }
    public static void main(String[] args) throws IOException {
        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        String line = bufferedReader.readLine();
        int ans = test(line);
        if (ans == 0) System.out.println("Just a legend");
        else System.out.println(line.substring(0,ans));
    }

}
