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;
char s[1000005];
int len, b[1000005];
void preprocess() {
  int i = 0, j = -1;
  b[0] = -1;
  while (i < len) {
    while (j >= 0 && s[j] != s[i]) j = b[j];
    i++;
    j++;
    b[i] = j;
  }
}
bool kmp(int i, int l, int len_suffix) {
  int j = 0;
  while (i < l) {
    while (j >= 0 && s[j] != s[i]) j = b[j];
    i++;
    j++;
    if (j == len_suffix) {
      return 1;
    }
  }
  return 0;
}
int main() {
  scanf("%s", &s);
  len = strlen(s);
  preprocess();
  int j = len, idx = -1;
  while (j = b[j]) {
    if (kmp(1, len - 1, j)) {
      idx = j;
      break;
    }
  }
  if (idx == -1)
    puts("Just a legend");
  else {
    for (j = 0; j < idx; ++j) printf("%c", s[j]);
    printf("\n");
  }
  return 0;
}