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 sys,os,io,time,copy,math
from collections import deque

if os.path.exists('input.txt'):
    sys.stdin = open('input.txt', 'r')
    sys.stdout = open('output.txt', 'w') 

def Z_arr(string): 
    n = len(string) 
    z=[0]*n
    l, r, k = 0, 0, 0
    for i in range(1, n):  
        if i > r: 
            l, r = i, i 
            while r < n and string[r - l] == string[r]: 
                r += 1
            z[i] = r - l 
            r -= 1
        else: 
            k = i - l 
            if z[k] < r - i + 1: 
                z[i] = z[k] 
            else: 
                l = i 
                while r < n and string[r - l] == string[r]: 
                    r += 1
                z[i] = r - l 
                r -= 1
    return z


def pi_table(string):
    n=len(string)
    table=[0 for i in range(len(string))]
    curr=0
    i=1
    while i<n:
        if string[i]==string[curr]:
            curr+=1
            table[i]=curr
            i+=1
        else:
            if curr!=0:
                curr=table[curr-1]
            else:
                table[i]=0
                i+=1
    return table

def main():
    string=input()
    n=len(string)
    table=Z_arr(string)
    table[0]=n
    m=0
    req=0
    for i in range(1,n):
        if table[i]+i==n and m>=table[i]:
            if table[i]>req:
                req=table[i]
            else:
                if table[i]>m:
                    m=table[i]
        else:
            if table[i]>m:
                m=table[i]
    if req==0:
        print("Just a legend")
    else:
        print(string[:req])



    
    

main()
