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.DataInputStream;
import java.io.FileInputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main {
	
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		
		char s[] = sc.nextLine().toCharArray();
		int n = s.length;
		int kmp[] = new int[n];
		
		kmp[0] = 0;
		
		int i = 1, j = 0;
		int max = 0;
		
		while(i < n) {
			while(j > 0 && s[i] != s[j]) j = kmp[j - 1];
			
			if(s[i] == s[j]) kmp[i++] = ++j;
			else kmp[i++] = 0;
			
			if(i < n)
				max = Math.max(max, kmp[i - 1]);
		}
		
		if(kmp[n - 1] > 0 && max >= kmp[n - 1]) {
			out.println(new String(s).substring(0, kmp[n - 1]));
		}
		else {
			max = kmp[n - 1];
			if(max != 0)
				max = kmp[max - 1];
			if(max == 0)
				out.println("Just a legend");
			else
				out.println(new String(s).substring(0, max));
		}
		
		out.flush();
		out.close();
	}

	static class Pair implements Comparable<Pair> {
		int a, b, d;
		
		public Pair(int x, int y) {
			a = x;
			b = y;
			d = Math.abs(x) + Math.abs(y);
		}
		
		@Override
		public int compareTo(Pair p) {
			return d - p.d;
		}
		
		@Override
		public String toString() {
			return a + " " + b;
		}
	}
	
	static class Scanner{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}

		public Scanner(FileReader r){	br = new BufferedReader(r);}

		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

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

		public String nextLine() throws IOException {return br.readLine();}

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

		public boolean ready() throws IOException {return br.ready();}
	}
}