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>
using namespace std;
const int MAX = 1e6;
int n, m, pos, maxL, maxR, maxZ, z[MAX + 1];
char s[MAX + 10];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  if (n < 3) {
    printf("Just a legend");
    return 0;
  }
  for (int i = 2; i <= n; ++i) {
    if (i <= maxR) z[i] = min(z[i - maxL + 1], maxR - i + 1);
    while (i + z[i] <= n && s[1 + z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 == n && maxZ >= z[i] && z[i] > m) {
      m = z[i];
      pos = i;
    }
    maxZ = max(maxZ, z[i]);
    if (i + z[i] - 1 > maxR) {
      maxR = i + z[i] - 1;
      maxL = i;
    }
  }
  if (!m)
    printf("Just a legend");
  else {
    s[pos + m] = '\0';
    printf("%s", s + pos);
  }
  return 0;
}