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.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
	
	public class A {
		
		static int[] prefixFunction(char[] s)		// O(n)
		{
			int n = s.length, pi[] = new int[n];
			for(int i = 1, j = 0; i < n; ++i)		//j = pi[i-1] at the beginning of every iteration
			{
				while(j > 0 && s[i] != s[j])
					j = pi[j-1];
				if(s[i] == s[j])
					++j;
				pi[i] = j;
			}
			return pi;
		}
		
		public static void main(String[] args) throws Exception{
			Scanner sc = new Scanner(System.in);
			PrintWriter out = new PrintWriter(System.out);
			String S = sc.next();
			char[] s = S.toCharArray();
			
			int[] kmp = prefixFunction(s);
			
			boolean[] suff = new boolean[s.length + 1];
			
			int t = kmp[s.length - 1];
			
			while(t > 0) {
				suff[t] = true;
				t = kmp[t - 1];
			}
			
			boolean[] sub = new boolean[s.length + 1];
			
			for (int i = 1; i < s.length - 1; i++) {
				t = kmp[i];
				
				while(t > 0 && !sub[t]) {
					sub[t] = true;
					t = kmp[t - 1];
				}
			}
			
			sub[0] = true;
			suff[0] = true;
			
			for (int i = s.length; i >= 0; i--)
				if(sub[i] && suff[i]) {
					out.println(i == 0 ? "Just a legend" : S.substring(0, i));
					break;
				}
			
			out.flush();
			out.close();
		}
		
		static class Scanner 
		{
			StringTokenizer st;
			BufferedReader br;
	
			public Scanner(InputStream System){	br = new BufferedReader(new InputStreamReader(System));}
			public String next() throws IOException 
			{
				while (st == null || !st.hasMoreTokens()) 
					st = new StringTokenizer(br.readLine());
				return st.nextToken();
			}
			public String nextLine()throws IOException{return br.readLine();}
			public int nextInt() throws IOException {return Integer.parseInt(next());}
			public double nextDouble() throws IOException {return Double.parseDouble(next());}
			public char nextChar()throws IOException{return next().charAt(0);}
			public Long nextLong()throws IOException{return Long.parseLong(next());}
			public boolean ready() throws IOException{return br.ready();}
			public void waitForInput(){for(long i = 0; i < 3e9; i++);}
		}
	}