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 str[1000100];
int zz[1000100], z[1000100];
int len;
void zfunction() {
  int left = 0, right = 0;
  len = strlen(str);
  for (int i = 1; i < len; ++i) {
    if (i > right) {
      left = right = i;
      while (right < len && str[right] == str[right - left]) {
        right++;
      }
      right--;
      zz[i] = right - left + 1;
    } else {
      int tmp = i - left;
      if (zz[tmp] < right - i + 1) {
        zz[i] = zz[tmp];
      } else {
        left = i;
        while (right < len && str[right] == str[right - left]) {
          right++;
        }
        right--;
        zz[i] = right - left + 1;
      }
    }
  }
}
int main() {
  scanf("%s", str);
  zfunction();
  int ans = -1;
  int maxm = 0;
  for (int i = 1; i < len; ++i) {
    if (i == len - zz[i] && zz[i] <= maxm) {
      ans = i;
      break;
    }
    maxm = max(maxm, zz[i]);
  }
  if (ans == -1)
    printf("Just a legend\n");
  else
    printf("%s\n", &str[ans]);
  return 0;
}