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 z[1000005], l = -1, r = -1, wynik, indeks;
int out[1000005];
int main() {
  scanf("%s", s);
  int n = strlen(s);
  int ile = 0;
  for (int i = 1; n > i; i++) {
    if (r > i) z[i] = min(r - i + 1, z[i - l]);
    while (z[i] + i < n and s[i + z[i]] == s[z[i]]) {
      z[i]++;
      ile++;
    }
    if (z[i] + i - 1 > r) {
      r = z[i] + i - 1;
      l = i;
    }
  }
  int maks = 0;
  for (int i = 1; n - 1 >= i; i++) {
    if (i + z[i] - 1 == n - 1 and maks >= z[i]) {
      wynik = z[i];
      indeks = i;
      break;
    }
    maks = max(maks, z[i]);
  }
  if (wynik == 0) {
    printf("Just a legend");
    return 0;
  }
  for (int i = indeks; wynik + indeks > i; i++) putchar(s[i]);
  return 0;
}