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.*;
import java.io.*;
import java.math.BigInteger;
public class C93D{
    static BufferedReader br;
    public static void main(String args[])throws Exception{
        br=new BufferedReader(new InputStreamReader(System.in));
        String str=toStr();
        if(str.length()<=2){
            System.out.println("Just a legend");
            return;
        }
        int ar[]=func(str);
        int nums[]=new int[ar.length+1];
        for(int i=0;i<ar.length;i++){
            nums[ar[i]]++;
        }
        int max=0;
        int c=0;
        int count=0;
        int suf[]=new int[str.length()];
        for(int i=1;i<ar.length;i++){
           
            if(ar[i]==ar.length-i){
                suf[c++]=ar[i];
            }
            else{
                if(max<ar[i]){
                    max=ar[i];
                }
            }
        }

        if(c>=2){
            int maxT=Math.max(suf[1],max);
            int min=Math.min(suf[0],maxT);
            System.out.println(str.substring(ar.length-min));
            return;
        }
        else{
            if(c>=1){
                if(max>=suf[0]){
                    System.out.println(str.substring(ar.length-suf[0]));
                }
                else System.out.println("Just a legend");
                return;
            }
        }


        System.out.println("Just a legend");
        
       
    }
    public static int[] func(String s) {
        int n = s.length();
        char sch[] = s.toCharArray();
        int z[] = new int[n];
        z[0] = 0;
        for (int i = 1, l = 0, r = 0; i < n; ++i) {
            if (i <= r) {
                z[i] = Math.min(r - i + 1, z[i - l]);

            }
            while (i + z[i] < n && sch[z[i]] == sch[i + z[i]]) {
                ++z[i];

            }
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }

        }
        return z;
    }

    /****************************************************************/
    public static int[] toIntArray()throws Exception{
       String str[]=br.readLine().split(" ");
       int k[]=new int[str.length];
       for(int i=0;i<str.length;i++){
            k[i]=Integer.parseInt(str[i]);
       }
       return k;
    }
    public static int toInt()throws Exception{
       return Integer.parseInt(br.readLine());
    }
    public static long[] toLongArray()throws Exception{
       String str[]=br.readLine().split(" ");
       long k[]=new long[str.length];
       for(int i=0;i<str.length;i++){
            k[i]=Long.parseLong(str[i]);
       }
       return k;
    }
    public static long toLong()throws Exception{
       return Long.parseLong(br.readLine());
    }
    public static double[] toDoubleArray()throws Exception{
       String str[]=br.readLine().split(" ");
       double k[]=new double[str.length];
       for(int i=0;i<str.length;i++){
            k[i]=Double.parseDouble(str[i]);
       }
       return k;
    }
    public static double toDouble()throws Exception{
       return Double.parseDouble(br.readLine());
    }
    public static String toStr()throws Exception{
       return br.readLine();
    }
    public static String[] toStrArray()throws Exception{
       String str[]=br.readLine().split(" ");
       return str;
    }
    /****************************************************************/

}