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;
long long izq, der, agregar = 1, mod = (1E16) + 61, cuanto = -1,
                    inv = 576923081, val[1000000], ag[1000000];
char cad[1000000];
int l, cuantos, longitud[1000000];
bool iguales(int a, int b, int dif) {
  for (int j = 0; j < dif; j++)
    if (cad[a + j] != cad[b + j]) return false;
  return true;
}
void encontre(int longi) {
  long long llevo = ((izq - (agregar * (long long)(cad[0] - 'a'))) * 26 +
                     (long long)(cad[longi] - 'a')) %
                    mod;
  if (llevo < 0) llevo += mod;
  if (llevo == izq && iguales(0, 1, longi)) {
    cuanto = longi;
    return;
  }
  for (int j = 1; j + longi + 1 < l; j++) {
    llevo = ((llevo - (agregar * (long long)(cad[j] - 'a'))) * 26 +
             (long long)(cad[longi + j] - 'a')) %
            mod;
    if (llevo < 0) llevo += mod;
    if (llevo == izq && iguales(0, j + 1, longi)) {
      cuanto = longi;
      return;
    }
  }
}
int main() {
  scanf("%s", cad);
  l = strlen(cad);
  for (int i = l - 1; i > 1; i--) {
    der = (der + (agregar * (long long)(cad[i] - 'a'))) % mod;
    izq = ((izq * 26) + (long long)(cad[l - i - 1] - 'a')) % mod;
    if (izq == der) {
      val[cuantos] = izq;
      ag[cuantos] = agregar;
      longitud[cuantos++] = l - i;
    }
    agregar = (agregar * 26) % mod;
  }
  for (int i = cuantos - 1; i > -1; i--) {
    izq = val[i];
    agregar = ag[i];
    if (iguales(0, l - longitud[i], longitud[i])) encontre(longitud[i]);
    if (cuanto != -1) break;
  }
  if (cuanto == -1)
    printf("Just a legend");
  else
    for (int i = 0; i < cuanto; i++) printf("%c", cad[i]);
}