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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.Map.Entry;

public class Main {
	
	public static void main(String[] args) throws IOException
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		String s = sc.nextLine();
		int z[] = zAlg(s.toCharArray());
		//System.out.println(Arrays.toString(z));
		int n = z.length;
		
		int maxSuf = 0;
		
		for(int i = 0; i < n; ++i)
			if(z[i] == n - i) maxSuf = Math.max(maxSuf, z[i]);
		
		if(maxSuf == 0) { System.out.println("Just a legend"); return; }
		
		for(int i = 0; i < n; ++i) 
			if(z[i] >= maxSuf && z[i] != n - i) {
				System.out.println(s.substring(0, maxSuf));
				return;
			}
		
		for(int i = 1; i < maxSuf; ++i)
		{
			if(z[i] >= maxSuf - i)
			{
				System.out.println(s.substring(0, maxSuf - i));
				return;
			}
		}
		out.println("Just a legend");
		
		out.flush();
		out.close();
	}
	
	private static int[] zAlg(char[] s)
	{
		int n = s.length;
		int z[] = new int[n];
		
		for(int i = 1, L = 0, R = 0; i < n; ++i)
		{
			if(R < i)
			{
				L = R = i;
				while(R < n && s[R] == s[R - L]) R++;
				z[i] = R - L; R--;
			}
			else
			{
				int k = i - L;
				if(i + z[k] <= R) z[i] = z[k];
				else
				{
					L = i;
					while(R < n && s[R] == s[R - L]) R++;
					z[i] = R - L; R--;
				}
			}
		}
		return z;
	}
	
	static class Pair implements Comparable<Pair>{
		long a;
		int b;
		
		public Pair(long x, int y) {
			a = x;
			b = y;
		}

		@Override
		public int compareTo(Pair p) {
			if(Long.compare(a, p.a) == 0)
				return Integer.compare(b, p.b);
			return Long.compare(a, p.a);
		}
	}
	
	static class Scanner{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public Scanner(FileReader r){	br = new BufferedReader(r);}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

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

		public String nextLine() throws IOException {return br.readLine();}

		public double nextDouble() throws IOException { return Double.parseDouble(next()); }

		public boolean ready() throws IOException {return br.ready();}
	}
}