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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author ATailouloute
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        QuickScanner in = new QuickScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Password solver = new Password();
        solver.solve(1, in, out);
        out.close();
    }

    static class Password {
        public void solve(int testNumber, QuickScanner in, PrintWriter out) {
            String s = in.nextString();
            int[] z = ZAlgorithm.get(s.toCharArray());
//        int mn = Integer.MAX_VALUE;
//        out.println(Arrays.toString(z));
            TreeSet<Integer> tree = new TreeSet<>();
            int len = 0;
            for (int i = z.length - 1; i > 0; i--) {
                if (z[i] != 0) {
                    Integer top = tree.floor(z[i]);
                    if (top != null && top > len) len = top;
                }
                if (z[i] != 0 && z[i] == z.length - i) {
                    tree.add(z[i]);
                }
            }
            out.println(len == 0 ? "Just a legend" : s.substring(0, len));
        }

    }

    static class QuickScanner {
        BufferedReader br;
        StringTokenizer st;
        InputStream is;

        public QuickScanner(InputStream stream) {
            is = stream;
            br = new BufferedReader(new InputStreamReader(stream), 32768);
        }

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

        public String nextString() {
            return nextToken();
        }

    }

    static class ZAlgorithm {
        public static int[] get(char[] s) {
            int n = s.length;
            int[] z = new int[n];
            int L = 0, R = 0;
            for (int i = 1; i < n; i++) {
                if (i > R) {
                    L = R = i;
                    while (R < n && s[R - L] == s[R]) R++;
                    z[i] = R - L;
                    R--;
                } else {
                    int k = i - L;
                    if (z[k] < R - i + 1) z[i] = z[k];
                    else {
                        L = i;
                        while (R < n && s[R - L] == s[R]) R++;
                        z[i] = R - L;
                        R--;
                    }
                }
            }
            return z;
        }

    }
}