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;
void get_next(int *next, char *substr, int sublen) {
  next[1] = 0;
  int i, j = 0;
  for (i = 2; i <= sublen; ++i) {
    while (j > 0 && substr[j + 1] != substr[i]) j = next[j];
    if (substr[j + 1] == substr[i]) ++j;
    next[i] = j;
  }
}
char str[1000003];
int nxt[1000002];
bool mp[1000002];
int main() {
  int len;
  while (gets(str + 1)) {
    len = strlen(str + 1);
    get_next(nxt, str, len);
    int j = len - 1;
    int ans = -1;
    for (int i = nxt[len]; i != 0; i = nxt[i]) {
      for (int k = i + 1; k <= j; ++k) mp[nxt[k]] = true;
      if (mp[i]) {
        ans = i;
        break;
      }
      j = i;
    }
    if (ans == -1)
      puts("Just a legend");
    else {
      for (int i = 1; i <= ans; ++i) putchar(str[i]);
      putchar('\n');
    }
    memset(mp, 0, sizeof(mp));
  }
  return 0;
}