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

/**
 * Codeforces #126B "Password"
 * @link http://codeforces.ru/problemset/problem/126/B
 * @author Caesar
 */
public class Solution126B implements Runnable {

    private static final int EXIT_CODE = -1;
    private static final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
    private static final String INPUT = "input.txt";
    private static final String OUTPUT = "output.txt";

    private StringTokenizer tok;
    private BufferedReader in;
    private PrintWriter out;

    public static void main(String[] args) {
        new Thread(new Solution126B()).start();
    }

    public void run() {
        try {
            in = ONLINE_JUDGE ?
                new BufferedReader(new InputStreamReader(System.in)) :
                new BufferedReader(new FileReader(INPUT));
            out = ONLINE_JUDGE ? new PrintWriter(System.out) : new PrintWriter(OUTPUT);
            long start = System.currentTimeMillis();
            try {
                solve();
            } finally {
                if (ONLINE_JUDGE) {
                    out.flush();
                } else {
                    out.close();
                }
            }
            System.err.println("Time used: " + (System.currentTimeMillis() - start));
        } catch (Throwable ex) {
            ex.printStackTrace();
            System.exit(EXIT_CODE);
        }
    }

    private String readString() throws IOException {
        while (tok == null || !tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

    private int readInt() throws IOException {
        return Integer.parseInt(readString());
    }

    public void solve() throws IOException {
        char[] s = readString().toCharArray();
        int n = s.length;
        final int p = 31;
        long[] pow = new long[n];
        pow[0] = 1L;
        for (int i = 1; i < n; ++i) {
            pow[i] = pow[i - 1] * p;
        }
        long[] h = new long[n];
        h[0] = s[0] - 'a' + 1;
        for (int i = 1; i < n; ++i) {
            h[i] = h[i - 1] + (s[i] - 'a' + 1) * pow[i];
        }
        LinkedList<Integer> list = new LinkedList<Integer>();
        for (int i = 1; i < n; ++i) {
            if (h[i - 1] * pow[n - i] == h[n - 1] - h[n - i - 1]) {
                list.add(i);
            }
        }
        int m = list.size();
        int[] len = new int[m];
        int i = 0;
        for (Integer x: list) {
            len[i++] = x;
        }
        int left = 0;
        int right = m - 1;
        Integer ans = null;
        while (left <= right) {
            int mid = (left + right) >> 1;
            boolean success = false;
            for (i = 1; i < n - len[mid]; ++i) {
                if (h[len[mid] - 1] * pow[i] == h[i + len[mid] - 1] - h[i - 1]) {
                    success = true;
                    break;
                }
            }
            if (success) {
                ans = len[mid];
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        if (ans == null) {
            out.println("Just a legend");
        } else {
            out.println(new String(s, 0, ans));
        }
    }

}