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

public class Main implements Runnable {
    public static void main(String[] args) {
        new Main().run();
    }

    BufferedReader br;
    StringTokenizer in;
    PrintWriter out;

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

    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
    public String nextLine() throws IOException {
        return nextToken();
    }
    public void solve() throws IOException {
        String s = nextLine();
        int n = s.length();
        int p[] = new int[n];
        for (int i = 1; i < n; 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;
        }
        int max = Integer.MIN_VALUE;
        int j = 0;
        if (p[n - 1] == 0){
            System.out.print("Just a legend");
            return;
        }
        for (int i = 1; i < n - 1; i++){
            if (p[i] == p[n - 1] && max < p[i]){
                max = p[i];
                j = i;
            }
        }
        if (max == Integer.MIN_VALUE){
            if (p[p[n - 1] - 1] == 0){
                System.out.print("Just a legend");
                return;
            }
            else{
                for (int i = 0; i < p[p[n - 1] - 1]; i++){
                    System.out.print(s.charAt(i));
                }
                return;
            }
        }
        for (int i = 0; i < p[j]; i++){
            System.out.print(s.charAt(i));
        }
    }

    public void run() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            //br = new BufferedReader(new FileReader("helloworld.in"));
            //out = new PrintWriter("helloworld.out");

            solve();

            //br.close();
            //out.close();
        } catch (IOException e) {
            e.printStackTrace();
            System.exit(1);
        }
    }
}