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>
const long long int N = 1000 * 1000, P = 709;
char s[N + 1];
unsigned int l, m = 0, h[N + 1] = {0}, p[N + 1] = {1};
int main() {
  gets(s);
  for (l = 0; s[l]; ++l) {
    p[l + 1] = p[l] * P;
    h[l + 1] = h[l] * P + s[l];
  }
  for (int k = l - 2; k > 0 && !m; --k)
    if (h[k] == h[l] - p[k] * h[l - k])
      for (int i = k + 1; i < l; ++i)
        if (h[k] == h[i] - p[k] * h[i - k]) m = k;
  s[m] = '\0';
  puts(m ? s : "Just a legend");
  return 0;
}