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

public class B
{
   public static void main(String[] args)
   {
      new B(new Scanner(System.in));
   }

   int[] genZValues(String s)
   {
      int[] res = new int[s.length()];
      int left = 0;
      int right = 0;
      for (int k=1; k<s.length(); k++)
      {
         int zk = 0;
         if (k > right)
         {
            int si = 0;
            while (((k+si)<s.length())&&(s.charAt(si) == s.charAt(k+si)))
               si++;
            zk = si;
            right = zk+k-1;
            left = k;
         }
         else
         {
            int kOld = k-left;
            int zOld = res[kOld];
            int b = right - k + 1;
            if (zOld < b)
               zk = zOld;
            else
            {
               zk = b;
               int si = b;
               while (((k+si)<s.length())&&(s.charAt(si) == s.charAt(k+si)))
                  si++;
               zk = si;
               right = zk + k - 1;
               left = k;
            }
         }
         res[k] = zk;
      }
      return res;
   }

   public B(Scanner in)
   {
      String s = in.next();
      int[] zValues = genZValues(s);
      int[] longest = new int[s.length()];
      for (int i=1; i<s.length(); i++)
         longest[i] = Math.max(zValues[i], longest[i-1]);
      
      int best = 0;
      for (int len=1; len<s.length(); len++)
      {
         int i = s.length()-len;
         if (zValues[i] < len)
            continue;
         int j = i-1;
         if (j < 1)
            break;
         if (longest[j] >= len)
            best = len;
      }

      String res = "Just a legend";
      if (best != 0)
         res = s.substring(0,best);
      System.out.println(res);
   }
}