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

public class password {
	public static void main(String[] args) {
		FastScanner scan=new FastScanner();
		PrintWriter out=new PrintWriter(System.out);
		
		char[] a=scan.next().toCharArray();
		int n=a.length;
		int[] z=z(a);
		
		boolean[] good=new boolean[n];
		int[] f=new int[n];
		
		for(int i=1;i<n;i++) {
			if(z[i]==n-i) {
				//prefix and suffix match, now we need to check if it exists somewhere inside
				good[i]=true;
			}
			f[z[i]]++;
		}
		
		for(int i=n-2;i>=0;i--) f[i]+=f[i+1];
		
		for(int i=0;i<n;i++) {
			if(good[i]&&f[n-i]>=2) {
				for(int j=i;j<n;j++) {
					out.print(a[j]);
				}
				out.close();
				return;
			}
		}
		out.println("Just a legend");
	    out.close();
	}
	public static int[] z(char[] a) {
		int n=a.length;
		int[] z=new int[n];
	    int l=0, r=0;
	    for(int i=1;i<n;i++) {
	        if (i>r) {
	            l=r=i;
	            while(r<n&&a[r-l]==a[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&&a[r-l]==a[r]) r++;
	                z[i]=r-l;
	                r--;
	            }
	        }
	    }
	    return z;
	}
	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 double nextDouble() {return Double.parseDouble(next());}

		public String nextLine() {
			String line = "";
			if(st.hasMoreTokens()) line = st.nextToken();
			else try {return br.readLine();}catch(IOException e){e.printStackTrace();}
			while(st.hasMoreTokens()) line += " "+st.nextToken();
			return line;
		}
	}
}