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.lang.*;
import java.awt.geom.Line2D;
import java.io.*;
import java.util.*;
import java.math.*;

public class B implements Runnable{
    
    public int[] pf(String str) {
        char[] s = str.toCharArray();
        int[] p = new int[s.length];
        int n = s.length;
        
        p[0] = 0;
        for (int i = 1; i < n; ++i) {
            int j = p[i-1];
            while (j > 0 && s[i] != s[j]) {
                j = p[j-1];
            }
            if (s[i] == s[j]) {
                ++j;
            }
            p[i] = j;
        }
        return p;
    }
    
    public void run() { 
        String str = nextLine();
        int[] p1 = pf(str);
        
        int maxLength = 0;
        
        HashSet<Integer> h = new HashSet<Integer>();
        long pow = 1L;
        long h1 = 0;
        long h2 = 0;
        
        for (int i = 0; i < str.length()-1; ++i) {
            h1 *= 31L;
            h1 += (int)(str.charAt(i) - 'a');
            
            h2 += pow*(int)(str.charAt(str.length()-i-1) - 'a');
            pow *= 31L;
            if (h1 == h2) {
                h.add(i+1);
            }
        }
        
        for (int i = 1; i < str.length()-1; ++i) {
            if (p1[i] > 0 && h.contains(p1[i])) {
                maxLength = Math.max(maxLength, p1[i]);
            }
        }
        
        if (maxLength == 0) {
            out.println("Just a legend");
        }
        else {
            for (int i = 0; i < maxLength; ++i) {
                out.print(str.charAt(i));
            }
            out.println();
        }
        
        out.flush();
    }
    
    private static BufferedReader br = null;
    private static PrintWriter out = null;
    private static StringTokenizer stk = null;
    
    public static void main(String[] args) {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        (new Thread(new B())).start();
    }
    
    private void loadLine() {
        try {
            stk = new StringTokenizer(br.readLine());
        }
        catch (IOException e) {
            e.printStackTrace();
        }
    }
    
    private String nextLine() {
        try {
            return br.readLine();
        }
        catch (IOException e) {
            e.printStackTrace();
        }
        return null;
    }
    
    private Integer nextInt() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Integer.parseInt(stk.nextToken());
    }
    
    private Long nextLong() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Long.parseLong(stk.nextToken());
    }
    
    private String nextWord() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return (stk.nextToken());
    }
    
    private Double nextDouble() {
        while (stk==null||!stk.hasMoreTokens()) loadLine();
        return Double.parseDouble(stk.nextToken());
    }
}