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
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
I'm working for the day I will surpass you
https://www.a2oj.com/Ladder16.html
*/
import java.util.*;
import java.io.*;
import java.math.*;

   public class x126B
   {
      static long BASE = 7L;
      static long[] exp;
      public static void main(String omkar[]) throws Exception
      {
         BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));  
         StringTokenizer st = new StringTokenizer(infile.readLine());
         String input = st.nextToken();
         char[] arr = input.toCharArray();
         int N = arr.length;
         ArrayList<Integer> ls = new ArrayList<Integer>();
         ArrayList<Long> hash = new ArrayList<Long>();
         exp = new long[1000001];
         exp[0] = 1L;
         for(int i=1; i <= 1000000; i++)
            exp[i] = exp[i-1]*BASE;
         long pref = 0L;
         long suff = 0L;
         for(int i=0; i < N; i++)
         {
            int j = N-1-i;
            if(j == 0)
               break;
            pref += exp[i]*arr[i];
            suff *= BASE;
            suff += arr[j];
            if(pref == suff)
            {
               ls.add(i+1);
               hash.add(pref);
            }
         }
         if(ls.size() == 0)
         {
            System.out.println("Just a legend");
            return;
         }
         int low = 0;
         int high = ls.size()-1;
         while(low != high)
         {
            int mid = (low+high+1)/2;
            int len = ls.get(mid);
            if(works(arr, N, len, hash.get(mid)))
               low = mid;
            else
               high = mid-1;
         }
         if(works(arr, N, ls.get(low), hash.get(low)))
            System.out.println(input.substring(0, ls.get(low)));
         else
            System.out.println("Just a legend");
      }
      public static boolean works(char[] arr, int N, int k, long check)
      {
         long hash = 0L;
         //go right to left to avoid division
         int right = N-2;
         int left = right-k+1;
         for(int i=left; i <= right; i++)
            hash += exp[i-left]*arr[i];
         if(hash == check && left > 0)
            return true;
         long yeah = exp[k-1];
         while(left > 1)
         {
            hash -= yeah*arr[right];
            left--;
            right--;
            hash *= BASE;
            hash += arr[left];
            if(hash == check)
               return true;
         }
         return false;
      }
   }