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 ns, k, n, m;
char s[1000010], t[1000010], p[1000010];
vector<int> vet;
int fail[1000010];
void buildFail(char *p) {
  int j = fail[0] = -1;
  for (int i = 1; i <= m; i++) {
    while (j >= 0 && p[j] != p[i - 1]) j = fail[j];
    fail[i] = ++j;
  }
}
int kmp(char *p, char *t) {
  buildFail(p);
  for (int i = 0, k = 0; i < n; i++) {
    while (k >= 0 && p[k] != t[i]) k = fail[k];
    if (++k >= m) {
      return 1;
      k = fail[k];
    }
  }
  return 0;
}
int test(int k) {
  int i, j;
  m = 0;
  for (i = 0, j = ns - k; i < k; i++, j++) {
    if (s[i] != s[j]) break;
    p[m++] = s[i];
  }
  if (i < k) return 0;
  p[m] = '\0';
  return kmp(p, t);
}
int main() {
  int lo, hi, mid;
  scanf(" %s", s);
  ns = strlen(s);
  vet.clear();
  m = ns;
  buildFail(s);
  k = ns;
  while (fail[k] > 0) {
    vet.push_back(fail[k]);
    k = fail[k];
  }
  sort(vet.begin(), vet.end());
  for (int i = 1; i < ns - 1; i++) t[i - 1] = s[i];
  t[n - 2] = '\0';
  n = ns - 2;
  lo = 0;
  hi = vet.size() - 1;
  k = 0;
  while (lo <= hi) {
    mid = (lo + hi) / 2;
    if (test(vet[mid])) {
      k = vet[mid];
      lo = mid + 1;
    } else
      hi = mid - 1;
  }
  if (!k)
    printf("Just a legend\n");
  else {
    for (int i = 0; i < k; i++) printf("%c", s[i]);
    printf("\n");
  }
  return 0;
}