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 math
import sys
from bisect import bisect_right, bisect_left, insort_right
from collections import Counter, defaultdict
from heapq import heappop, heappush
from itertools import accumulate, permutations, combinations
from sys import stdout

R = lambda: map(int, input().split())
s = input()
n = len(s)
z = [0] * n
l, r = 0, 0
for i in range(1, n):
    if i > r:
        k = i
        while k < n and s[k] == s[k - i]:
            k += 1
        l, r = i, k - 1
        z[l] = r - l + 1
    else:
        if i + z[i - l] <= r:
            z[i] = z[i - l]
        else:
            j = r + 1
            while j < n and s[j] == s[j - i]:
                j += 1
            l, r = i, j - 1
            z[i] = r - l + 1
sz = sorted(z[1:])
for l in range(n - 1, 0, -1):
    if z[n - l] == l and len(sz) - bisect_left(sz, l) >= 2:
        print(s[:l])
        exit(0)
print('Just a legend')
