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>
const int MAXN = 1E6 + 10;
int next[MAXN];
char text[MAXN];
void GetNext(const char* p) {
  int j = 0;
  next[0] = next[1] = 0;
  for (int i = 1; p[i]; ++i) {
    while (j && p[i] != p[j]) j = next[j];
    if (p[i] == p[j]) ++j;
    next[i + 1] = j;
  }
}
bool KMP(const char* t, int len_t, const char* p, int len_p) {
  int j = 0;
  for (int i = 0; i < len_t; ++i) {
    while (j && t[i] != p[j]) j = next[j];
    if (t[i] == p[j]) ++j;
    if (j == len_p) return true;
  }
  return false;
}
int main() {
  while (~scanf("%s", text)) {
    GetNext(text);
    int len = strlen(text);
    int j = next[len];
    int ans = 0;
    while (j) {
      if (KMP(text + 1, len - 2, text, j)) {
        ans = j;
        break;
      }
      j = next[j];
    }
    if (ans == 0)
      puts("Just a legend");
    else
      puts(text + len - ans);
  }
}