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 fail[1010000], c[1010000];
char pat[1010000];
void getnext() {
  int i, k, n;
  i = 0, k = -1;
  n = strlen(pat);
  fail[i] = -1;
  while (i < n) {
    if (k == -1 || pat[i] == pat[k]) {
      ++i;
      ++k;
      fail[i] = k;
    } else
      k = fail[k];
  }
}
int main() {
  int i, j, n, k, ans;
  while (scanf("%s", pat) != EOF) {
    getnext();
    n = strlen(pat);
    for (i = 0; i <= n; i++) {
      c[i] = 0;
    }
    for (i = n; i >= 0; i--) {
      c[fail[i]] += c[i] + 1;
    }
    j = fail[n];
    ans = -1;
    while (j > 0) {
      k = c[j];
      if (k > 1) {
        ans = j;
        break;
      } else
        j = fail[j];
    }
    if (ans > 0) {
      for (i = 0; i < ans; i++) {
        printf("%c", pat[i]);
      }
      printf("\n");
    } else
      printf("Just a legend\n");
  }
  return 0;
}