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.util.Scanner;

public class Parol {
 static int[] count;
 public static void main(String[] args) {
  Scanner scan = new Scanner(System.in);
  String st = scan.next();
  int[] array = new int[st.length()];
  count = new int[st.length()];
  pref(st,array);
  int len = array[st.length()-1];
  if(len>0 && count[len]<2)
   len = array[len-1];
  if(len==0)
   System.out.println("Just a legend");
  else
   System.out.println(st.substring(0,len));
  
 }

 
 public static void pref(String match,int[] arr)
 {
  arr[0] = 0;
  int index = 0;
  for(int i=1;i<match.length();)
  {
   if(match.charAt(i)==match.charAt(index))
   {
    arr[i] = index+1;
    index++;
    i++;
    count[index]++;
   }
   else
   {
    if(index!=0)
     index = arr[index-1];
    else
    {
     arr[i] = 0;
     i++;
     count[0]++;
    }
   }
  }
 }

}