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:
/*
 *  Date: 5/9/12
 *   Time: 15:52
 *   Author: 
 *      Alexander Marchuk
 *      aamarchuk@gmail.com
 */

//package Password;

import java.io.InputStream;
import java.util.Scanner;

public class Password {

    int N;
    String str;
    char[] s;
    int[] prefixF;
    String inside;

    public boolean readString(InputStream input) {
        Scanner in = new Scanner(input);
        str = in.nextLine();
        s = str.toCharArray();
        N = str.length();
        prefixF = new int[N];
        if(N > 2){
            inside = str.substring(1, N-1);
            return true;
        }else {
            return false;
        }
    }

    public void prefixFunction() {
        if (0 == N)
            return;
        prefixF[0] = 0;
        // System.out.print(prefixF[0]+" ");
        for (int current = 1; current < N; ++current) {
            int matched_prefix = current - 1;
            int candidate = prefixF[matched_prefix];
            while (candidate != 0 && s[current] != s[candidate]) {
                matched_prefix = prefixF[matched_prefix] - 1;
                candidate = prefixF[matched_prefix];
            }

            if (candidate == 0)
                prefixF[current] = s[current] == s[0] ? 1 : 0;
            else
                prefixF[current] = candidate + 1;
            // System.out.print(prefixF[current]+" ");
        }
    }

    public void findAnsw() {

        this.prefixFunction();
        int size = prefixF[N - 1];
        if (size == 0) {
            System.out.println("Just a legend");
        } else {
            while(size > 0){
                String candidate = str.substring(0, size);

                for(int i = size; i < N-1; i++){
                    if(prefixF[i] == size){
                        System.out.println(candidate);
                        return;
                    }
                }
                size = prefixF[candidate.length()-1];
            }
            System.out.println("Just a legend");
        }
    }

    public boolean oneSymblol(String t){
        int i = 0;
        char [] arr = t.toCharArray();
        while(i < t.length()-1 && arr[i] == arr[i+1]){
            i++;
        }
        if(i == t.length()-1){
            return true;
        } else {
            return false;
        }
    }


    public static void main(String[] args) {
        Password p = new Password();
        if (!p.readString(System.in)){
            System.out.println("Just a legend");
            return;
        }
        p.findAnsw();
    }


}