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

/*
br = new BufferedReader(new FileReader("input.txt"));
pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
br = new BufferedReader(new InputStreamReader(System.in));
pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
 */

public class Main {
	private static BufferedReader br;
	private static StringTokenizer st;
	private static PrintWriter pw;

	static final long HASH = 3137;
	
	public static void main(String[] args) throws IOException	{
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		long[] pow = new long[1000010];
		pow[0] = 1;
		for(int i = 1; i < pow.length; i++)	{
			pow[i] = pow[i-1] * HASH;
		}
		String str = nextToken();
		long[] hash = new long[str.length()+1];
		for(int i = 0; i < str.length(); i++)	{
			hash[i+1] = hash[i] * HASH + str.charAt(i);
		}
		ArrayList<Integer> valid = new ArrayList<Integer>();
		for(int len = 1; len <= str.length()-2; len++)	{
			long prefix = hash[len];
			long suffix = hash[str.length()] - hash[str.length()-len] * pow[len];
			if(prefix == suffix)	{
				valid.add(len);
			}
		}
		int min = -1;
		int max = valid.size()-1;
		while(min != max)		{
			int mid = (min+max)/2;
			if(min == mid)	{
				mid++;
			}
			int len = valid.get(mid);
			boolean can = false;
			for(int k = 1; !can && k + len < str.length(); k++)	{
				long curr = hash[k+len] - hash[k] * pow[len];
				can = curr == hash[len];
			}
			if(can)	{
				min = mid;
			}
			else	{
				max = mid-1;
			}
		}
		if(min == -1)
			pw.println("Just a legend");
		else
			pw.println(str.substring(0,valid.get(min)));
		pw.close();
	}

	/* NOTEBOOK CODE */

	public static void loadArray(int[][] grid) throws IOException {
		for(int[] a: grid)
			loadArray(a);
	}

	public static void loadArray(int[] in) throws IOException {
		for(int i = 0; i < in.length; i++)
			in[i] = readInt();
	}

	public static void loadArray(long[] in) throws IOException {
		for(int i = 0; i < in.length; i++)
			in[i] = readLong();
	}

	private static long readLong() throws IOException	{
		return Long.parseLong(nextToken());
	}

	private static double readDouble() throws IOException	{
		return Double.parseDouble(nextToken());
	}

	private static int readInt() throws IOException	{
		return Integer.parseInt(nextToken());
	}

	private static String nextToken() throws IOException	{
		while(st == null || !st.hasMoreTokens())	{
			if(!br.ready())	{
				pw.close();
				System.exit(0);
			}
			st = new StringTokenizer(br.readLine().trim());
		}
		return st.nextToken();
	}
}