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.io.*;
import java.lang.*;
import java.util.*;
import java.math.*;

public class code2
{
    static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                {
                    st = new StringTokenizer(br.readLine()); 
                }
                catch (IOException  e) 
                {
                    e.printStackTrace(); 
                }
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            {
                str = br.readLine(); 
            }
            catch (IOException e) 
            {
                e.printStackTrace(); 
            }
            return str; 
        } 
    }


    public static void main(String args[])throws IOException
    {
        FastReader scn = new FastReader();
        OutputStream out = new BufferedOutputStream(System.out);

        String input = scn.nextLine();
        int length = input.length();
        if(length <= 2)
        {
            System.out.println("Just a legend");
            return;
        }

        int[] lps = new int[length];
        
        int len = 0;
        lps[0] = len;
        for(int i = 1; i < length; i++)
        {
            if(input.charAt(len) == input.charAt(i))
            {
                len = len + 1;
                lps[i] = len;
            }
            else if(len != 0)
            {
                len = lps[len - 1];
                i--;
            }
            else
            {
                lps[i] = 0;
            }
        }

        int max_index = 0;
        for(int i = 0; i < length - 1; i++)
        {
            if(lps[max_index] <= lps[i])
                max_index = i;
        }

        if(lps[max_index] == 0)
        {
            System.out.println("Just a legend");
            return;
        }

        String input_next = input.substring(max_index - lps[max_index] + 1, length);
        int length_next = input_next.length();

        int[] lps_next = new int[length_next];
        int len_next = 0;
        lps_next[0] = len_next;
        for(int i = 1; i < length_next; i++)
        {
            if(input_next.charAt(len_next) == input_next.charAt(i))
            {
                len_next = len_next + 1;
                lps_next[i] = len_next;
            }
            else if(len_next != 0)
            {
                len_next = lps_next[len_next - 1];
                i--;
            }
            else
            {
                lps_next[i] = 0;
            }
        }

        if(lps_next[length_next - 1] == 0)
        {
            System.out.println("Just a legend");
            return;
        }

        System.out.println(input.substring(0, lps_next[length_next - 1]));
    }
}