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>
int n;
char s[1024000];
long h[1024000];
int p[1024000];
long pow(long a, long b) {
  if (b <= 0)
    return 1;
  else if (b % 2 == 1)
    return a * pow(a, b - 1);
  else {
    long root = pow(a, b / 2);
    return root * root;
  }
}
void rollHash() {
  h[n - 1] = s[n - 1];
  for (int i = n - 2; i >= 0; i--) {
    h[i] = s[i] + h[i + 1] * 33;
  }
}
long hashSubstr(int i, int j) { return h[i] - h[j + 1] * pow(33, j + 1 - i); }
int prefix() {
  int i, j, aux = -1, aux2 = -1, aux3 = 0;
  for (i = 0; i < n - 1; i++) {
    if (hashSubstr(0, i) == hashSubstr(n - i - 1, n - 1)) {
      aux2 = aux;
      aux = i;
    }
  }
  aux3 = hashSubstr(0, aux);
  for (j = 1; j + aux < n - 1; j++) {
    if (aux3 == hashSubstr(j, aux + j)) return aux;
  }
  if (aux2 == -1) return -1;
  return aux2;
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  rollHash();
  int index = prefix();
  if (index == -1)
    printf("Just a legend\n");
  else {
    char c[n];
    strcpy(c, s);
    c[index + 1] = '\0';
    printf("%s\n", c);
  }
  return 0;
}