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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.StringTokenizer;

public class Main {
    public static void main(String[] args) throws IOException {
        FastScanner scanner = new FastScanner();
        String s = scanner.next();
        int length = password(s);
        System.out.println(length > 0 ? s.substring(0, length) : "Just a legend");
    }

    private static int[] z(String s) {
        int[] z = new int[s.length()];
        z[0] = 0;
        int l = 0, r = 0;
        for (int i = 1; i < s.length(); i++) {
            if (r >= i && z[i - l] < r - i + 1) {
                z[i] = z[i - l];
                continue;
            }

            int j = Math.max(0, r - i + 1);
            z[i] = j;
            for (;i + j < s.length() && s.charAt(j) == s.charAt(i + j); j++) {
                z[i]++;
            }
            l = i;
            r = l + z[i] - 1;
        }
        return z;
    }

    private static int password(String s) {
        int[] z = z(s);
        int sL = s.length();
        List<Integer> suff = new ArrayList<>();
        for (int i = 0; i < sL; i++) {
            if (z[i] > 0 && i + z[i] == sL) suff.add(z[i]);
        }

        int candidate = -1;
        for (int i = 0; i < suff.size(); i++) {
            candidate = suff.get(i);
            for (int j = 0; j < sL - candidate; j++) {
                if (z[j] >= candidate) {
                    return candidate;
                }
            }
            candidate = -1;
        }

        return candidate;
    }

    public static class FastScanner {
        StringTokenizer tok = new StringTokenizer("");
        BufferedReader in;

        public FastScanner() {
            in = new BufferedReader(new InputStreamReader(System.in));
        }

        public String next() throws IOException {
            while (!tok.hasMoreElements())
                tok = new StringTokenizer(in.readLine());
            return tok.nextToken();
        }

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

        public long nextLong() throws IOException {
            return Long.parseLong(next());
        }
    }
}