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 CPP):

Solution:
#include <bits/stdc++.h>
unsigned h[1024000], t;
char s[1024000];
int L, M, i, l;
unsigned p(int x) {
  unsigned r = 1, t = 29;
  for (; x; x >>= 1, t *= t)
    if (x & 1) r *= t;
  return r;
}
int main() {
  gets(s);
  for (t; s[l]; ++l) h[l] = t = t * 29 + s[l];
  for (M = l - 1; M && !L; --M) {
    t = p(M);
    if (h[l - 1] != h[l - 1 - M] * t + h[M - 1]) continue;
    for (i = 0; i + M + 1 < l; ++i)
      if (h[i] * t + h[M - 1] == h[i + M]) L = M;
  }
  s[L] = 0;
  puts(L ? s : "Just a legend");
  return 0;
}