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

public class Main
{
    
    public static final long q = 1000000000 + 7;
    public static String S;
    public static int N;
    public static int [] A;
    public static int [] B;
    
    public static char Get(int k, int i)
    {
        if (k == 0) return S.charAt(i);
        else return S.charAt(N - i - 1);
    }
    
    public static int [] CalC(int status)
    {
        int [] Z = new int [N];
        Z[0] = N;
        int L = 0, R = 0;
        for (int i = 1; i < N; i++)
            if (i > R)
            {
                L = R = i;
                while (R < N && Get(status, R - L) == Get(status, R)) R++;
                Z[i] = R - L;
                R--;
            }
            else
            {
                int k = i - L;
                if (Z[k] < R - i + 1) Z[i] = Z[k];
                else
                {
                    L = i;
                    while (R < N && Get(status, R - L) == Get(status, R)) R++;
                    Z[i] = R - L;
                    R--;
                }
            }
        return Z;
    }
    
    public static void main(String[] args)
    {
        Scanner cin = new Scanner (System.in);
        S = cin.nextLine();
        N = S.length();
        
        int [] A = new int [N];
        A = CalC(0);
        int [] B = new int [N];
        B = CalC(1);
        for (int L = 0, R = N - 1, tmp; L < R; L++, R--)
        {
            tmp = B[L];
            B[L] = B[R];
            B[R] = tmp;
        }
        int [] C = new int [N];
        for (int i = N - 1; i >= 0; i--)
        {
            if (B[i] == 0) continue;
            int k = i - B[i] + 1;
            if (B[i] != N) C[k] = Math.max(C[k], B[i]);
        }
        
        int len = -1, start = -1;
        int ans = C[0] - 1;
        
        for (int i = 1; i < N - 1; i++, ans--)
        {
            ans = Math.max(ans, C[i]);
            if (ans > 0 && ans > len && ans <= A[i])
            {
                len = ans;
                start = i;
            }
        }
        
        if (len > 0) System.out.print(S.substring(start, start + len));
        else System.out.print("Just a legend"); 
    }

}