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

public class Main {
    public static void main(String[] args) throws IOException {
        FastScanner in = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        new Main().run(in, out);
        out.close();
    }

    void run(FastScanner in, PrintWriter out) {

        // longest string that is prefix, suffix, and inside s
        String s = in.next();
        ca = s.toCharArray();
        n = ca.length;

        z = new int[n];
        computeZ();

        MaxStack maxStack = new MaxStack();

        int maxLen = 0;
        for (int i = 1; i < n; i++) {
            maxStack.push(z[i]);
        }
        for (int i = n-1; i >= 2; i--) {
            maxStack.pop(z[i]);
            int currLen = z[i];
            if (i+z[i] == n && maxStack.getMax() >= currLen) {
                maxLen = Math.max(maxLen, currLen);
            }
        }

        if (maxLen == 0) {
            out.println("Just a legend");
        } else {
            out.println(s.substring(0, maxLen));
        }
    }

    class MaxStack {
        LinkedList<Integer> l = new LinkedList<>();
        void push(int x) {
            if (l.isEmpty() || x >= l.peekLast()) l.offerLast(x);
        }
        void pop(int x) {
            if (l.peekLast() == x) l.pollLast();
        }
        int getMax() {
            return l.peekLast();
        }
    }



    char[] ca;
    int n;
    int[] z;

    void computeZ() {
        int l = 0;
        int r = 0;
        for (int i = 1; i < n; i++) {
            if (i <= r) {
                z[i] = Math.min(z[i-l], r-i+1);
            }
            while (i+z[i] < n && ca[i+z[i]] == ca[z[i]]) z[i]++;
            if (i+z[i]-1 > r) {
                l = i;
                r = i+z[i]-1;
            }
        }
    }

    static class FastScanner {

        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream in) {
            br = new BufferedReader(new InputStreamReader(in));
            st = null;
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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