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.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class P127D
{
	public static void main(String[] args)
	{
		FastScanner scan = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		String str = scan.next();
		if (str.length() <= 2)
		{
			pw.println("Just a legend");
			pw.flush();
			return;
		}
		String s = str.substring(1, str.length()-1);
		int[] lps = getLPS(str);
		int max = 0;
		for (int i = 1; i < lps.length-1; i++)
			max = Math.max(max, lps[i]);
		int len = lps[str.length()-1];
		while (len > 0 && len > max)
			len = lps[len-1];
		pw.println(len == 0 ? "Just a legend" : str.substring(0, len));
		pw.flush();
	}

	private static boolean kmp(String str, String patt, int[] lps)
	{
		int j = 0;
		for (int i = 0; i < str.length();)
		{
			if (str.charAt(i) == patt.charAt(j))
			{
				i++;
				j++;
				if (j == patt.length())
					return true;
			}
			else if (j > 0)
				j = lps[j-1];
			else
				i++;
		}
		return false;
	}

	private static int[] getLPS(String s)
	{
		int[] lps = new int[s.length()];
		int j = 0;
		for (int i = 1; i < lps.length;)
		{
			if (s.charAt(i) == s.charAt(j))
			{
				lps[i] = j+1;
				i++;
				j++;
			}
			else if (j > 0)
				j = lps[j-1];
			else
				i++;
		}
		return lps;
	}
	
	static class FastScanner
	{
		BufferedReader br;
		StringTokenizer st;

		public FastScanner()
		{
			try
			{
				br = new BufferedReader(new InputStreamReader(System.in));
				st = new StringTokenizer(br.readLine());
			} catch (Exception e)
			{
				e.printStackTrace();
			}
		}

		public String next()
		{
			if (st.hasMoreTokens())
				return st.nextToken();
			try
			{
				st = new StringTokenizer(br.readLine());
			} catch (Exception e)
			{
				e.printStackTrace();
			}
			return st.nextToken();
		}

		public int nextInt()
		{
			return Integer.parseInt(next());
		}

		public long nextLong()
		{
			return Long.parseLong(next());
		}

		public String nextLine()
		{
			String line = "";
			try
			{
				line = br.readLine();
			} catch (Exception e)
			{
				e.printStackTrace();
			}
			return line;
		}
	}
}
