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;
int pi[1000005], z_array[1000005], len;
char str[1000005], reverse_str[1000005];
void pi_table_generator(void) {
  int i, k = -1;
  pi[0] = -1;
  for (i = 1; i <= len; i++) {
    while (k >= 0 && reverse_str[k] != reverse_str[i - 1]) k = pi[k];
    pi[i] = ++k;
  }
  return;
}
void making_z_array(void) {
  int L = 0, R = 0;
  for (int i = 1; i < len; i++) {
    if (i > R) {
      L = R = i;
      while (R < len && str[R - L] == str[R]) R++;
      z_array[i] = R - L;
      R--;
    } else {
      int k = i - L;
      if (z_array[k] < R - i + 1)
        z_array[i] = z_array[k];
      else {
        L = i;
        while (R < len && str[R - L] == str[R]) R++;
        z_array[i] = R - L;
        R--;
      }
    }
  }
}
int main() {
  gets(str);
  int i;
  len = strlen(str);
  for (i = 0; i < len; i++) reverse_str[i] = str[len - i - 1];
  pi_table_generator();
  making_z_array();
  int maximum = -1;
  for (i = 1; i < len - 1; i++) {
    if (z_array[len - i - 1] < pi[i + 1]) continue;
    maximum = max(maximum, pi[i + 1]);
  }
  if (maximum == 0 || maximum == -1) {
    printf("Just a legend\n");
    return 0;
  }
  for (i = 0; i < maximum; i++) printf("%c", str[i]);
  printf("\n");
  return 0;
}