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

public class D {

    public static void main(String[] args) throws IOException {
        InputReader in = new InputReader();
        String s = in.next();
        char[] a = s.toCharArray();
        size = a.length;
        F = new int[size + 1];
        preprocess(a);
        int x = F[size];
        if (x == 0)
            System.out.println("Just a legend");
        else {
            for (int i = 2; i < size; i++) {
                if (F[i] == x) {
                    System.out.println(s.substring(0, x));
                    return;
                }
            }
            if (F[x] != 0) {
                System.out.println(s.substring(0, F[x]));
                return;
            }
            System.out.println("Just a legend");
        }
    }

    static int size;
    static int[] F;

    public static void preprocess(char[] p) {
        F[0] = F[1] = 0;
        int j;
        for (int i = 2; i <= size; i++) {
            j = F[i - 1];
            while (true) {
                if (p[j] == p[i - 1]) {
                    F[i] = j + 1;
                    break;
                }
                if (j == 0) {
                    F[i] = 0;
                    break;
                }
                j = F[j];
            }
        }
    }

    static class InputReader {
        BufferedReader in;
        StringTokenizer st;

        public InputReader() throws IOException {
            in = new BufferedReader(new InputStreamReader(System.in));
            st = new StringTokenizer(in.readLine());
        }

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

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

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