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:
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author Nilesh
 */

import java.util.*;
import java.io.*;

public class Zlgorithm {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        
        Scanner in = new Scanner(System.in);
        String s = in.next();
        
        Integer[] z = new Integer[1000005];
        Integer R = 0, L = 0;
        
        z[0] = new Integer(0);
        int n = s.length();
        
        for( int i = 1; i < s.length(); i++ ) {
            if( i > R ) {
                L = R = i;
                while( R < n && s.charAt(R-L) == s.charAt(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.charAt(R-L) == s.charAt(R) ) R++;
                    z[i] = R-L; R--;
                }            
            }
        }
        
        int maxz = 0, ans = 0;
        for( int i = 1; i < n; i++ )
          if( z[i] == n-i && maxz >= n-i )
          {  ans = n-i; break; }
          else
              maxz = Math.max(maxz, z[i] );
        
        if( ans == 0 )
            System.out.print("Just a legend");
        else
            System.out.print(s.substring(0, ans));
        
        
    }
}