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
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Round93_B {

    int[] z;

    public void run(String str) {
        char[] s = str.toCharArray();
        int n = s.length;
        z = new int[n];
        z[0] = n;
        int L = 0, R = 0;
        for (int i = 1; i < n; i++) {
            // System.out.println(" ******  At " + i);
            // System.out.print("from " + L + " " + R + "\t");
            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--;
                }
            }
            // System.out.println("to " + L + " " + R);
        }
    }

    ArrayList<Integer> sufPref;

    int N;

    public int bs(int val) {
        int low = 0;
        int high = sufPref.size() - 1;
        int ans = -1;
        while (low <= high) {

            if (high - low < 2) {
                if (sufPref.get(low) <= val)
                    ans = Math.max(ans, low);
                if (sufPref.get(high) <= val)
                    ans = Math.max(ans, high);
                break;
            }

            int mid = low + (high - low) / 2;
            if (sufPref.get(mid) > val) {
                // go left
                high = mid - 1;
            } else {
                // go right
                ans = Math.max(ans, mid);
                low = mid + 1;
            }

        }

        return ans;
    }

    public void solve() throws Exception {

        String s = new InputReader().next();
        run(s);
        N = z.length;
        // ascending
        sufPref = new ArrayList<Integer>();
        // get all suffpreff
        for (int i = N - 1; i > 0; i--) {
            if (z[i] == N - i)
                sufPref.add(N - i);
        }
//      System.out.println(Arrays.toString(sufPref.toArray()));
        int ans = 0;

        for (int i = 1; i < N; i++) {
            if (z[i] != 0) {
                int y = bs(z[i]);
//              System.out.println(z[i] + " " + y);
                if (y != -1) {
                    if (z[i] != N - i)
                        ans = Math.max(ans, sufPref.get(y));
                    else if (y > 0)
                        ans = Math.max(ans, sufPref.get(y - 1));

                }
            }
        }

        if (ans != 0)
            System.out.println(s.substring(0, ans));
        else
            System.out.println("Just a legend");
    }

    public static void main(String[] args) throws Exception {
        new Round93_B().solve();
    }

    static class InputReader {
        BufferedReader in;
        StringTokenizer st;

        public InputReader() throws IOException {
            in = new BufferedReader(new InputStreamReader(System.in));
            st = new StringTokenizer(in.readLine());

        }

        public String next() throws IOException {

            while (!st.hasMoreElements())
                st = new StringTokenizer(in.readLine());
            return st.nextToken();
        }

        public int nextInt() throws NumberFormatException, IOException {
            return Integer.parseInt(next());
        }

        public long nextLong() throws NumberFormatException, IOException {
            return Long.parseLong(next());
        }
    }

}
