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

public class Main {

        public static void main(String[] args) throws Exception {
                PrintWriter pr = new PrintWriter(System.out,true);
                BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
                //StringTokenizer tz = new StringTokenizer(in.readLine());   
                //Scanner s = new Scanner(System.in);
                String s = in.readLine();
                int pref[] = new int[s.length()];
                int mas[] = new int[s.length()];
                pf(s,pref,mas);
                int k = pref[pref.length-1];
                while(k > 0 && mas[k] < 2) {
                        k = pref[k-1];
                }
                if(mas[k] >= 2) {
                        pr.println(s.substring(0, k));
                        return;
                }
                pr.println("Just a legend");
                /*for(int i = 0;i < mas.length;i++) {
                        pr.print(pref[i]+" ");
                }
                pr.println();
                for(int i = 0;i < mas.length;i++) {
                        pr.print(mas[i]+" ");
                }
                pr.flush();*/
        }
        
        public static void pf(String p, int pref[],int mas[]) {
        pref[0] = 0;
        for(int i = 1,j = 0;i < p.length();i++) {
                while(j > 0 && p.charAt(i) != p.charAt(j)) {
                        j = pref[j-1];
                }
                if(p.charAt(i) == p.charAt(j)) j++;
                pref[i] = j;
                int h = j;
                while(h > 0 && mas[h] < 2) {
                        mas[h]++;
                        h = pref[h-1];
                }
        }
    }
}