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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main {
	public static void main(String[] args) throws IOException {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;

		// InputStream inputStream = new FileInputStream("input.txt");
		// OutputStream outputStream = new FileOutputStream("output.txt");

		InputReader in = new InputReader(inputStream);
		OutputWriter out = new OutputWriter(outputStream);

		TaskA solver = new TaskA();
		solver.solve(in, out);

		out.close();
	}
}

class TaskA {

	public void solve(InputReader in, OutputWriter out) {
		
		String s = in.nextLine();
		int n = s.length();
		
		int[] z = zFunction(s);
		int max=0;
		for(int i=1; i<n; i++)
			if(i+z[i]<n) 
				max = Math.max(max, z[i]);
			else
				max = Math.max(max, z[i]-1);
		
		hashPref = new long[n];
		hashSuf = new long[n];
		
		hashPref[0] = s.charAt(0);
		hashSuf[n-1] = s.charAt(n-1);
		p = 1;
		for(int i=1; i<n; i++){
			p = (p*pow)%MOD;
			
			hashPref[i] = (hashPref[i-1]+s.charAt(i)*p)%MOD;
			hashSuf[n-i-1] = (hashSuf[n-i]*pow+s.charAt(n-i-1))%MOD;
		}
		
		for(int i=n-1; i>0; i--){
			if(hashPref[i-1]==hashSuf[n-i] && i<=max){
				//for(int j=0; j<i; j++)
					//out.write(s.charAt(j));
				out.write(s.substring(0, i));
				return;
			}
		}
		
		out.write("Just a legend");
	}
	
	int[] zFunction(String s){
		int n = s.length();
		int[] z = new int[n];
		
		for(int i=1, l=0, r=0; i<n; i++){
			if(i<=r)
				z[i] = Math.min(z[i-l], r-i+1);
			while(i+z[i]<n && s.charAt(i+z[i])==s.charAt(z[i]))
				z[i]++;
			if(i+z[i]-1>r){
				l = i;
				r = i+z[i]-1;
			}
		}
		
		return z;
	}
	
	long p,pow=17,MOD=1000000007;
	long[] hashPref,hashSuf;
}

class InputReader {

	BufferedReader reader;
	StringTokenizer tokenizer;

	public InputReader(InputStream stream) {
		tokenizer = null;
		reader = new BufferedReader(new InputStreamReader(stream));
	}

	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException();
			}
		}

		return tokenizer.nextToken();
	}

	public String nextLine() {
		tokenizer = null;
		try {
			return reader.readLine();
		} catch (IOException e) {
			throw new RuntimeException();
		}
	}

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

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

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

	public int[] nextIntArray(int n) {
		int[] res = new int[n];
		for (int i = 0; i < n; i++)
			res[i] = nextInt();

		return res;
	}

}

class OutputWriter {

	PrintWriter out;

	public OutputWriter(OutputStream stream) {
		out = new PrintWriter(
				new BufferedWriter(new OutputStreamWriter(stream)));
	}

	public void write(Object... o) {
		for (Object cur : o)
			out.print(cur);
	}

	public void writeln(Object... o) {
		write(o);
		out.println();
	}

	public void flush() {
		out.flush();
	}

	public void close() {
		out.close();
	}

}