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
//Created by Aminul on 11/2/2020.

import java.io.*;
import java.util.*;

import static java.lang.Math.*;

public class Test {
    public static void main(String[] args) throws Exception {
        Scanner in = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        
        String string = in.next();
        char[] str = string.toCharArray();
        int n = str.length;
        int[] z = computeZ(str);
        
        int[] sum = new int[n + 1];
        for (int i : z) {
            sum[1]++;
            sum[i + 1]--;
        }

        for (int i = 1; i <= n; i++) {
            sum[i] += sum[i - 1];
        }

        int res = -1;
        for (int i = 1; i < n; i++) {
            if (i + z[i] >= n && sum[z[i]] > 1) {
                res = z[i];
                break;
            }
        }

        if (res == -1) pw.println("Just a legend");
        else pw.println(string.substring(0, res));

        pw.close();
    }

    static int[] computeZ(char[] s) {
        int n = s.length;
        int[] z = new int[n];
        for (int i = 1, l = 0, r = 0; i < n; ++i) {
            if (i <= r)
                z[i] = min(r - i + 1, z[i - l]);
            while (i + z[i] < n && s[z[i]] == s[i + z[i]])
                ++z[i];
            if (i + z[i] - 1 > r) {
                l = i;
                r = i + z[i] - 1;
            }
        }
        return z;
    }

    static void debug(Object... obj) {
        System.err.println(Arrays.deepToString(obj));
    }
}