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 z[1000010];
char a[1000010];
int main() {
  scanf("%s", &a);
  memset(z, 0, sizeof(z));
  int xx = strlen(a);
  int i, j, k;
  int l = 0, r = 0;
  z[0] = 0;
  z[0] = xx;
  for (int i = 1, l = 0, r = 0; i < xx; ++i) {
    if (l && (i + z[i - l] < r))
      z[i] = z[i - l];
    else {
      int j = min(l ? z[i - l] : 0, i > r ? 0 : r - i);
      while (a[i + j] == a[j]) ++j;
      z[i] = j, l = i, r = i + j;
    }
  }
  int loc = -1, maxi = 0;
  for (i = 1; i < xx; i++) {
    if (z[i] == xx - i && maxi >= z[i]) {
      loc = i;
      maxi = z[i];
      break;
    }
    maxi = max(maxi, z[i]);
  }
  if (loc == -1)
    cout << "Just a legend";
  else {
    for (i = loc; i < (loc + maxi); i++) printf("%c", a[i]);
  }
  return 0;
}