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 len;
char ch;
char T[1000010];
int nexxt[1000010];
int find_t(int le) {
  int i = 1, j = 0;
  while (i < len - 1 && j <= le) {
    if (j == -1 || T[i] == T[j]) {
      i++;
      j++;
    } else
      j = nexxt[j];
  }
  if (j == le + 1) return 1;
  return 0;
}
int bo(int le) {
  int y = len;
  while (nexxt[y] >= le + 1) {
    if (nexxt[y] == le + 1)
      return 1;
    else
      y = nexxt[y];
  }
  return 0;
}
int main() {
  int i, j;
  len = 0;
  while ((ch = getchar()) != '\n') {
    T[len] = ch;
    len++;
  }
  T[len] = '4';
  nexxt[0] = -1;
  nexxt[1] = 0;
  for (i = 2; i <= len; i++) {
    j = i - 1;
    while (nexxt[j] != -1 && T[nexxt[j]] != T[i - 1]) {
      j = nexxt[j];
    }
    nexxt[i] = nexxt[j] + 1;
  }
  for (i = len - 2; i >= 0; i--) {
    if (i == -1) break;
    if (bo(i) && find_t(i)) break;
  }
  if (i == -1)
    printf("Just a legend");
  else {
    for (j = 0; j <= i; j++) {
      printf("%c", T[j]);
    }
  }
  return 0;
}