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.sql.Array;
import java.text.DecimalFormat;
import java.util.*;

public class Main {

    private static class node {
        int l, r, f;
        long w;

        node(int ll, int rr) {
            l = ll;
            r = rr;
        }
    }

    public static node[] tree = new node[400005];
    public static Scanner sc = new Scanner(System.in);
    public static int edgeNum = 0;
    public static int[] s = new int[205];
    public static int[] e = new int[205];
    public static int[] c = new int[205];
    public static int[] head = new int[205];
    public static int[] depth = new int[205];
    public static int begin, end;

    public static int[] getNext(String ps) {
        char[] p = ps.toCharArray();
        int[] next = new int[p.length];
        next[0] = -1;
        int j = 0, k = -1;
        while (j < p.length - 1) {
            if (k == -1 || p[j] == p[k]) {
                k++;
                j++;
                next[j] = k;
            } else {
                k = next[k];
            }
        }
        return next;
    }

    public static int kmp(String ts, String ps) {
        char[] t = ts.toCharArray();
        char[] p = ps.toCharArray();
        int i = 0, j = 0;
        int[] next = getNext(ps);
        while (i < t.length && j < p.length) {
            if (j == -1 || t[i] == p[j]) {
                i++;
                j++;
            } else {
                j = next[j];
            }
        }
        if (j == p.length) {
            return i - j;
        } else {
            return -1;
        }
    }

    public static int[] getNext2(String ps) {
        char[] t = ps.toCharArray();
        int[] next = new int[t.length];
        int a = 0, p = 0;
        next[0] = ps.length();
        for (int i = 1; i < ps.length(); i++) {
            if (i >= p || i + next[i - a] >= p) {
                if (i >= p) {
                    p = i;
                }

                while (p < ps.length() && t[p] == t[p - i]) {
                    p++;
                }

                next[i] = p - i;
                a = i;
            } else {
                next[i] = next[i - a];
            }
        }

        return next;
    }

    public static int[] ekmp(String s1, String t1) {
        char[] s = s1.toCharArray();
        char[] t = t1.toCharArray();
        int a = 0, p = 0;
        int[] next = getNext2(t1);
        int[] extend = new int[s1.length()];

        for (int i = 0; i < s1.length(); i++) {
            if (i >= p || i + next[i - a] >= p) {
                if (i >= p) {
                    p = i;
                }

                while (p < s1.length() && s[p] == t[p - i]) {
                    p++;
                }

                extend[i] = p - i;
                a = i;
            } else {
                extend[i] = next[i - a];
            }
        }

        return extend;
    }

    public static void main(String[] args) throws Exception {
        while (sc.hasNext()) {
            String t = sc.nextLine();
            int next[] = getNext(t);
            String tmp = new StringBuilder(t).reverse().toString();
            int extend[] = getNext2(tmp);

            int res = 0, pos = 0;
            for (int i = 0; i < next.length; i++) {
                if (next[i] > 0) {
                    if (extend[next.length - i] >= next[i]) {
                        if (next[i] > res) {
                            res = next[i];
                            pos = i;
                        }
                    }
                }
            }
            if (res == 0) {
                System.out.println("Just a legend");
            } else {
                System.out.println(t.substring(pos - res, pos));
            }
//            for (int i = 0; i < next.length; i++) {
//                System.out.print(t.charAt(i)+" ");
//            }
//            System.out.println();
//
//            for (int i = 0; i < next.length; i++) {
//                System.out.print(next[i]+" ");
//            }
//
//            System.out.println();
//
//            for (int i = 0; i < extend.length; i++) {
//                System.out.print(tmp.charAt(i)+" ");
//            }
//            System.out.println();
//
//            for (int i = 0; i < extend.length; i++) {
//                System.out.print(extend[i]+" ");
//            }
        }
    }
}