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.*;

public class Main {
    public static void main(String args[]) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        new Solver().solve(in, out);
        out.close();
    }
}

class Hasher {
    private static final long P = 37;

    private long hash[], power[];

    public Hasher(String s) {
        power = new long[s.length()];
        hash = new long[s.length()];

        power[0] = P;
        for (int i = 1; i < power.length; i++) {
            power[i] = power[i - 1] * P;
        }
        hash[0] = s.charAt(0) * power[0];
        for (int i = 1; i < hash.length; i++) {
            hash[i] = hash[i - 1] + s.charAt(i) * power[i];
        }
    }

    public long getHash(int from, int to) {
        if (from > 0) {
            return hash[to] - hash[from - 1];
        } else {
            return hash[to];
        }
    }

    public boolean equal(int i1, int j1, int i2, int j2) {
        return getHash(i1, j1) * power[power.length - 1 - i1] ==
                getHash(i2, j2) * power[power.length - 1 - i2];
    }
}

class Solver {
    public void solve(InputReader in, PrintWriter out) {
        String s = in.next();
        int p[] = new int[s.length()];
        for (int i = 1; i < s.length(); i++) {
            int j = p[i - 1];
            while (j > 0 && s.charAt(i) != s.charAt(j))
                j = p[j - 1];
            if (s.charAt(i) == s.charAt(j))
                j++;
            p[i] = j;
        }
        Hasher hasher = new Hasher(s);
        int ans = -1;
        for (int i = 1; i < s.length() - 1; i++) {
            if (p[i] != 0) {
                if (hasher.equal(0, p[i] - 1, p.length - p[i], p.length - 1) &&
                        hasher.equal(0, p[i] - 1, i - p[i] + 1, i)) {
                    if (p[i] > ans)
                        ans = p[i];
                }
            }
        }
        if (ans == -1) {
            out.println("Just a legend");
        } else {
            out.println(s.substring(0, ans));
        }
    }
}

class InputReader {
    protected BufferedReader reader;
    protected StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (Exception e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public double nextDouble() {
        return Double.parseDouble(next());
    }
}