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 arr[1000005];
char str[1000005];
int max = -(1 << 30);
void f(int len) {
  int idx = 1;
  int length = 0;
  arr[0] = 0;
  while (idx < len) {
    if (str[length] != str[idx]) {
      if (length == 0) {
        arr[idx++] = 0;
      } else
        length = arr[length - 1];
    } else {
      length++;
      arr[idx] = length;
      if (max < arr[idx]) {
        max = arr[idx];
      }
      idx++;
    }
  }
  return;
}
int main() {
  for (int i = 0; i < 1000005; i++) {
    arr[i] = 0;
  }
  max = -(1 << 30);
  scanf("%s", str);
  int len = strlen(str);
  f(len);
  max = arr[len - 1];
  int find = 0;
  int flag = 0;
  while (true) {
    if (max == 0) {
      flag = 0;
      break;
    }
    for (int i = 1; i < len - 1; i++) {
      if (arr[i] == max) {
        find = i;
        flag = 1;
        break;
      }
    }
    if (flag == 1) {
      break;
    }
    int temp = arr[max - 1];
    max = temp;
  }
  if (flag == 0)
    printf("Just a legend");
  else {
    for (int i = 0; i < max; i++) {
      printf("%c", str[i]);
    }
  }
  puts("");
  return 0;
}