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.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.*;

/*
 * Daniel Otero Baguer
 * CodeForces #93
 * Problem: D
 */
public class D
{
		  
	BufferedReader in;
	PrintStream out;
	StringTokenizer tok;
	
	public static int[] zAlgorithm(CharSequence s) 
	{
        int length = s.length();
        int[] z = new int[length];
        z[0] = 0;

        int left = 0, right = 0;
        for (int i = 1; i < length; i++) 
        {
                if (i > right) {
                        int j;
                        //noinspection StatementWithEmptyBody
                        for (j = 0; i + j < length && s.charAt(i + j) == s.charAt(j); j++) ;
                        z[i] = j;
                        left = i;
                        right = i + j - 1;
                } else if (z[i - left] < right - i + 1)
                        z[i] = z[i - left];
                else {
                        int j;
                        //noinspection StatementWithEmptyBody
                        for (j = 1; right + j < length && s.charAt(right + j) == s.charAt(right - i + j); j++) ;
                        z[i] = right - i + j;
                        left = i;
                        right = right + j - 1;
                }
        }
        return z;
	}

	public D() throws NumberFormatException, IOException
	{
		in = new BufferedReader(new InputStreamReader(System.in));
		//in = new BufferedReader(new FileReader("in.txt"));
		out = System.out;
		run();
	}
	void run() throws NumberFormatException, IOException
	{
		String s = nextToken();
		int n = s.length();
		
		int[] ans  = new int[ n + 2 ] ; 
		
		int[] z = zAlgorithm(s);
		for (int i = 1; i < n; i++)
            ans[ z[i] ]++;  
        for (int i = n; i >= 0; i--)
            ans[i] += ans[i + 1];
		
		boolean legend = true;
		for(int i = 1; i<n; i++)
		{
			if(z[i]==n-i && ans[n-i]>1) 
			{
				out.println(s.substring(0,n-i));
				legend = false;
				break;
			}
		}
		if(legend)out.println("Just a legend");
	}
	public static void main(String[] args) throws NumberFormatException, IOException 
	{
		new D();
	}
	String nextToken() throws IOException
	{
		if(tok ==null || !tok.hasMoreTokens()) tok = new StringTokenizer(in.readLine());
		return tok.nextToken();
	}
	int nextInt() throws NumberFormatException, IOException
	{
		return Integer.parseInt(nextToken());
	}
	long nextLong() throws NumberFormatException, IOException
	{
		return Long.parseLong(nextToken());
	}
	double nextDouble() throws NumberFormatException, IOException
	{
		return Double.parseDouble(nextToken());
	}
}
