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
# def buildPre(p):
#     pre = [0] * len(p)
#     i = 1
#     j = 0
#     while i < len(p):
#         if p[i] == p[j]:
#             j += 1
#             pre[i] = j
#             i += 1
#         else:
#             if j == 0:
#                 i += 1
#             else:
#                 j = pre[j - 1]
#     return pre
#
#
# def hashP(oldVal, char):
#     return (oldVal * 33 + ord(char)) % (10 ** 9 + 7)
#
#
# def hashPR(oldVal, char, I):
#     return (oldVal + ord(char) * I) % (10 ** 9 + 7)
#
#
# def solveA(s):
#     preHash = 0
#     sufHash = 0
#     a = 1
#     res = []
#     for i in xrange(len(s) - 1):
#         preHash = hashP(preHash, s[i])
#         sufHash = hashPR(sufHash, s[len(s) - i - 1], a)
#         a *= 33
#         a %= (10 ** 9 + 7)
#         if preHash == sufHash:
#             # if s[:i + 1] == s[len(s) - i - 1:]:
#             res.append(i + 1)
#     return res[::-1]
#
#
# def kmp(s, p, l, pre):
#     n = len(s)
#     m = l
#     i = j = 0
#     c = 0
#     while i < n:
#         if p[j] == s[i]:
#             i += 1
#             j += 1
#         if j == m:
#             c += 1
#             j = pre[j - 1]
#         elif i < n and p[j] != s[i]:
#             if j != 0:
#                 j = pre[j - 1]
#             else:
#                 i += 1
#     return c
#
#
# # print kmp("aaaaa", "aa", 2, buildPre("aa"))
#
#
# def solve(s, p):
#     if len(p) > len(s):
#         return 0
#     if len(p) == 1:
#         return len(s)
#     S = []
#     P = []
#     for i in xrange(1, len(s)):
#         S.append(s[i] - s[i - 1])
#     for i in xrange(1, len(p)):
#         P.append(p[i] - p[i - 1])
#     pre = buildPre(P)
#     return kmp(S, P, len(P), pre)
#
#
# # print solve("aaa")
# # print solve("fixprefixsuffix")
# # print buildPre("abcdabc")
# # print solve("abadaba")
# # print solve("abcdabc")
# # N, W = map(int, raw_input().split(" "))
# raw_input()
# s = map(int, raw_input().split(" "))
# p = map(int, raw_input().split(" "))
# print solve(s, p)
def buildPre(p):
    pre = [0] * len(p)
    i = 1
    j = 0
    while i < len(p):
        if p[i] == p[j]:
            j += 1
            pre[i] = j
            i += 1
        else:
            if j == 0:
                i += 1
            else:
                j = pre[j - 1]
    return pre


def hashP(oldVal, char):
    return (oldVal * 33 + ord(char)) % (10 ** 9 + 7)


def hashPR(oldVal, char, I):
    return (oldVal + ord(char) * I) % (10 ** 9 + 7)


def solveA(s):
    preHash = 0
    sufHash = 0
    a = 1
    res = []
    for i in xrange(len(s) - 1):
        preHash = hashP(preHash, s[i])
        sufHash = hashPR(sufHash, s[len(s) - i - 1], a)
        a *= 33
        a %= (10 ** 9 + 7)
        if preHash == sufHash:
            # if s[:i + 1] == s[len(s) - i - 1:]:
            res.append(i + 1)
    return res[::-1]


def kmp(s, p, l, pre):
    n = len(s) - 1
    m = l
    i = j = 0
    while i < n:
        if p[j] == s[i]:
            i += 1
            j += 1
        if j == m:
            if i - j != 0:
                return True

            j = pre[j - 1]
        elif i < n and p[j] != s[i]:
            if j != 0:
                j = pre[j - 1]
            else:
                i += 1
    return False


# print kmp("aaaaa", "aa", 2, buildPre("aa"))


def solve(s):
    pre = buildPre(s)
    for size in solveA(s):
        if kmp(s, s, size, pre):
            return s[:size]
    return "Just a legend"


# print solve("aaa")
# print solve("fixprefixsuffix")
# print buildPre("abcdabc")
# print solve("abadaba")
# print solve("abcdabc")

S = raw_input()
print solve(S)
