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.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.io.InputStream;

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

class TaskB {
    public void solve(int testNumber, Scanner in, PrintWriter out) {
        String x = in.nextLine();
        int[] z = z(x);
        int bl = 0;
        int maxz = 0;
        for (int i = 0; i < x.length(); i++) {
            if (z[i] > bl && z[i] + i == x.length() && maxz + i >= x.length()) {
                bl = z[i];
            }
            maxz = Math.max(maxz, z[i]);
        }
        if(bl == 0) {
            out.println("Just a legend");
        } else {
            out.println(x.substring(0, bl));
        }
    }

    int[] z(String a) {
        int[] z = new int[a.length()];
        int L = 0;
        int R = 0;
        for (int i = 1; i < a.length(); i++) {
            if (R < i) {
                L = R = i;
                while (R < a.length() && a.charAt(R - L) == a.charAt(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 < a.length() && a.charAt(R - L) == a.charAt(R)) R++;
                    z[i] = R - L;
                    R--;
                }
            }
        }
        return z;
    }
}