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:
// Tuan Kyou
// http://codeforces.com/contest/126/problem/B
import java.io.*;
import java.util.Scanner; 
import java.util.*;
import java.lang.*;

public class Main {
    static final int MAX_N = 1000006;
    static int kmp[] = new int [MAX_N];
    static String s;
    static int m;
    public static void main (String[] args) throws Exception {
        InputReader sc = new InputReader(System.in);
        //StringBuilder sb = new StringBuilder();
        s = sc.next();
        m = s.length();
        KMPPreprocess();
        int x = kmp[m-1];
        if (x == 0)
            System.out.println("Just a legend");
        else if (findElement(1, m - 1, x))
            System.out.println(s.substring(0, x));
        else if (kmp[x - 1] == 0)
            System.out.println("Just a legend");
        else if (kmp[x - 1] != 0)
            System.out.println(s.substring(0, kmp[x-1]));
        else
            System.out.println("Just a legend");
    }
    
    static boolean findElement(int start, int end, int elem){
        for(int i = start; i < end; ++i)
            if(kmp[i] == elem)
                return true;
        return false;
    }

    static void printString(String s, int end){
        System.out.println(s.substring(0, end));
    }
    static void KMPPreprocess(){
        kmp[0] = 0;
        int i = 1, j = 0;
        while(i < m){
            if(s.charAt(i) == s.charAt(j)){
                j++;
                kmp[i] = j;
                i++;
            }
            else{
                if(j != 0){
                    j = kmp[j-1];
                }
                else{
                    kmp[i] = 0;
                    i++;
                }
            }
        }
    }
    public static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

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

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