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.awt.List;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.ObjectInputStream.GetField;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.text.DecimalFormat;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.InputMismatchException;
import java.util.Locale;
import java.util.TimeZone;

public class A {

	public static void main(String[] args) {
		Locale.setDefault(Locale.US);
		InputStream inputstream = System.in;
		OutputStream outputstream = System.out;
		FastReader in = new FastReader(inputstream);
		PrintWriter out = new PrintWriter(outputstream);
		TaskA solver = new TaskA();
		// int testcase = in.ni();
		for (int i = 0; i < 1; i++)
			solver.solve(i, in, out);
		out.close();

	}

}

class TaskA {

	static int  n ;
	static int z[];
	
	static void compute(char s[]){
		n = s.length;
		z = new int[n];
		
		int l = 0, r= 0, k = 0;
		
		for(int i =0;i<n;i++){
			if(i > r){
				l = r = i;
				while(r < n && s[r-l] == s[r]){
					r++;
				}
				z[i] = r -l;
				r--;
			}else{
				k = i - l;
				if(z[k] < r -i +1){
					z[i] = z[k];
				}else{
					l = i;
					while(r < n && s[r-l] == s[r]){
						r++;
					}
					
					z[i] = r - l;
					r--;
				}
			}
			
		}
	}
	static public void solve(int testnumber, FastReader in, PrintWriter out) {
			String s = in.ns();
			compute(s.toCharArray());
			
			int max[] = new int[s.length()];
			max[0] = z[0];
			
			for(int i = 1;i<n;i++){
				max[i] = Math.max(max[i-1], z[i]);
			}
			int ans = 0;
			for(int i = n-1;i>0;i--){
				if(z[i] == (n-i) && max[i-1] >= z[i]){
					ans = z[i];
				}
			}
			
			if(ans == 0 ){
				out.println("Just a legend");
			}else{
				out.println(s.substring(0, ans));
			}
			
			
	}
}

class FastReader {
	public InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public FastReader(InputStream stream) {
		this.stream = stream;
	}

	public FastReader() {

	}

	public int read() {
		if (numChars == -1) {
			throw new InputMismatchException();
		}
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0) {
				return -1;
			}
		}
		return buf[curChar++];
	}

	public int ni() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String ns() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public boolean isSpaceChar(int c) {
		if (filter != null) {
			return filter.isSpaceChar(c);
		}
		return isWhitespace(c);
	}

	public static boolean isWhitespace(int c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public int[] iArr(int n) {
		int a[] = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		return a;
	}

	public String next() {
		return ns();
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}

}