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

public class Password {
	public static void main(String[] args){
		FastScanner sc = new FastScanner();
		String s = sc.nextToken();

		int[] z = new int[s.length()];
		int n = s.length();
		int L = 0, R = 0;
		//note that maxZ does not care about z[0] = n
		//so it keeps track only of length of longest infix
		int maxZ = 0;
		for (int i = 1; i < n; i++) {
			if (i > R) {
				//bf
				L = R = i;
				while (R < n && s.charAt(R-L) == s.charAt(R)) R++;
				z[i] = R-L; R--;
			} else {
				int k = i-L;
				//beta inside alpha, and closed by a1 != a2
				if (z[k] < R-i+1) z[i] = z[k];
				else {
					//bf
					L = i;
					while (R < n && s.charAt(R-L) == s.charAt(R)) R++;
					z[i] = R-L; R--;
				}
			}
			if(z[i] == n-i && maxZ >= n-i){
				System.out.println(s.substring(0,z[i]));
				return;
			}
			maxZ = Math.max(z[i],maxZ);
		}
		
		System.out.println("Just a legend");
	}

	public static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner(String s) {
			try {
				br = new BufferedReader(new FileReader(s));
			} catch (FileNotFoundException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}

		public FastScanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String nextToken() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt() {
			return Integer.parseInt(nextToken());
		}

		long nextLong() {
			return Long.parseLong(nextToken());
		}

		double nextDouble() {
			return Double.parseDouble(nextToken());
		}
	}
}