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 p[1000005];
bool isSuffix[1000005];
int n;
void kmp() {
  int lg = 0;
  p[0] = 0;
  for (int m = 1; m < n; m++) {
    while (lg > 0 && s[lg] != s[m]) lg = p[lg - 1];
    if (s[lg] == s[m]) lg++;
    p[m] = lg;
  }
}
int main() {
  scanf("%s", s);
  n = strlen(s);
  kmp();
  fill(isSuffix, isSuffix + n + 1, false);
  int k = p[n - 1];
  while (k != 0) {
    isSuffix[k] = true;
    k = p[k - 1];
  }
  for (int i = 0; i < n; i++) {
  }
  int maxlen = 0;
  if (p[n - 1] != 0) {
    for (int i = 1; i < n - 1; i++) {
      if (p[i] > maxlen && isSuffix[p[i]]) {
        maxlen = p[i];
      }
    }
  }
  if (maxlen) {
    s[maxlen] = 0;
    printf("%s\n", s);
  } else
    printf("Just a legend\n");
  return 0;
}